N Queen Problem Backtracking

[ishika22]

🚀 Feature

We need to place N chess queens on an N×N chessboard so that no two queens attack each other.

Have you read the Contribution Guidelines?

Yes

Pitch

This is a very common problem which uses the concept of backtracking. Initially we can mark a box as taken and if in further steps we find that the queen might be attacked, we can backtrack and remove our queen from that position.

Assignees

(Do not make changes in this section until asked to do so)
C -
C# -
C++ - @vedant-jain03 Go -
Java - @ishika22 Javascript -
Kotlin - @sgaurav37533 Python - @Abhiram-Joshi

[ishika22]

@manan025 I would like to work on the above problem using JAVA

[manan025]

Sure, @ishika22 - Java Assigned

[vedant-jain03]

I want to work in C++

[sgaurav37533]

Hey @manan025 please assign me this problem in Kotlin

[manan025]

@sgaurav37533 - Kotlin assigned

[manan025]

@vedant-jain03 - C++ assigned

[Abhiram-Joshi]

I would like to do this in python

[manan025]

@Abhiram-Joshi - Python assigned