N_Queen problem [ Backtracking]

[Nikhila-KS]

Problem- Place N chess queens on an N×N chessboard so that no two queens attack each other.

Example : if n=4 then the following is a solution for the 4 Queen problem. 0 1 0 0 0 0 0 1 1 0 0 0 0 0 1 0 Where 1 represents the positions in which queen is placed

[Nikhila-KS]

Hello @Parul-Mann Can you assign this issue to me?

[Monachaudhary]

Kindly assign this to me. I can solve it in the best time and space complexity.

[gh4abhi]

Please assign this to me I will do it in C++17.

[Shreyg-27]

Hello @Parul-Mann. Can this issue be assigned to me? I will code it in Python

[AarnaSinghal]

Hello please assign this issue to me @Parul-Mann

[BhavyaDevani]

@gdsc-igdtuw @Parul-Mann pls assign this issue to me

[ssom01-github]

hello, please assign the issue to me

[Akansha3001]

Please assign this issue to me