N-Queens Problem

[jpsxlr8]

I would like to add the N-Queens problem to the repo. N queens problem is one of the most common examples of backtracking. Our goal is to arrange N queens on an NxN chessboard such that no queen can strike down any other queen. A queen can attack horizontally, vertically, or diagonally.

Please assign me this task.

[SwaggyRajput]

Hello sir, can u assign me this issue. I would love to grab this opportunity.

[PurviSaiChoure]

I would like to contribute in this issue. Please assign this to me.

[Sakshiwalode28]

I would like to contribute to the issue. Please assign this task to me.

[krushnal57]

hello, sir i would like to solve this issue, i would like to solve the problem through a new my point of view. can you assign this issue to me?

[vrinda01go]

Hey! I am interested in adding this problem and solving it through a beginner-friendly approach. Could you please assign me this?@jpsxlr8

[ShiveshSinghRao]

hey! I am interested in this problem as I have already solved this with two different approaches kindly assign this to me

[mohan792]

Hey, I have learned about N-Queens using Backtracking. I would really like to grab this opportunity and contribute. Please assign this task to me...

[github-actions[bot]]

This issue has been automatically marked as abandoned because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions[bot]]

Please ping one of the maintainers once you add more information and updates here. If this is not the case and you need some help, feel free to ask for help in our Gitter channel or our Discord server. Thank you for your contributions!