Open ritik307 opened 2 years ago
@piyushsharma220699 I want to solve this in C++, Kindly assign this issue to me as a part of hacktoberfest-2021
@ritik307 Assigned in C++ :)
@piyushsharma220699 I want to solve this in Java, Kindly assign this issue to me under hacktoberfest
@Anuradha0501 I'll assign this to you in Java, but now this repo has been excluded from Hacktoberfest 2021, please read the pinned issue of this repo to know more
@Anuradha0501 I'll assign this to you in Java, but now this repo has been excluded from Hacktoberfest 2021, please read the pinned issue of this repo to know more
ok
The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.
Given an integer n, return all distinct solutions to the n-queens puzzle. You may return the answer in any order.
Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space, respectively.
Reference IMG
Example 1:
Input: n = 4 Output: [[".Q..","...Q","Q...","..Q."],["..Q.","Q...","...Q",".Q.."]] Explanation: There exist two distinct solutions to the 4-queens puzzle as shown above.
Example 2:
Input: n = 1 Output: [["Q"]]