Leetcode Problem 51. N-Queens

51. N-Queens

Leetcode Solutions

Initialize three sets to keep track of the columns, diagonals, and anti-diagonals that are already occupied by queens.
Define a recursive function backtrack that takes the current row, the board, and the sets as arguments.
If the current row is equal to n, a solution has been found. Convert the board to the required format and add it to the solutions list.
For each column in the current row, calculate the corresponding diagonal and anti-diagonal.
If the column, diagonal, and anti-diagonal are not occupied, place a queen at the current position.
Update the sets to mark the column, diagonal, and anti-diagonal as occupied.
Recursively call backtrack for the next row.
If a solution is not found, backtrack by removing the queen and updating the sets accordingly.
Continue this process until all solutions are found.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen