Add N Queens Problem

[Ayush-Garg1]

Problem Statement: N Queens

Description:
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.

Input:
An integer n

Output:
A list of all possible placements.

Example:
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

Constraints:
1 <= n <= 9

PLEASE ASSIGN THIS ISSUE TO ME AS PART OF HACKTOBERFEST 2024.
THANK YOU

[github-actions]

Thank you for raising a issue, Hope you enjoing the open source. we try to reply or assign as soon possibe. Connect with mentor.