I would like to add a solution to the N queens problem. N is the size of a chess board.
and we are required to place n number of queens in the n * n cells of the board such that no queen can kill another.
I would like to solve the same using backtracking in Java.
Kindly assign this to me under the hacktoberfest.