cpp-flashcards/org/study_deck_02/dsa/backtracking/0052-n-queens-ii.org

#+PROPERTY: STUDY_DECK_02
* TODO 0052. N Queens II :hard:
:PROPERTIES:
:NEETCODE: [[file:../../roadmap.org::*0052. N Queens II][0052. N Queens II]]
:END:

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 /the number of distinct solutions to the *n-queens puzzle*/.

*Example 1:*


#+begin_src
Input: n = 4
Output: 2
Explanation: There are two distinct solutions to the 4-queens puzzle as shown.
#+end_src


*Example 2:*


#+begin_src
Input: n = 1
Output: 1
#+end_src


*Constraints:*

 - ~1 <= n <= 9~

** TODO Approach
Write your approach here.

** TODO Python
#+begin_src python
class Solution:
    def totalNQueens(self, n: int) -> int:
#+end_src

** TODO C++
#+begin_src cpp
class Solution {
public:
    int totalNQueens(int n) {
        
    }
};
#+end_src