tomatocream
1dec88aaf2
Add populate-notes.mjs that fetches problem descriptions and Python/C++ code stubs from LeetCode's GraphQL API. Populated all 197 NeetCode 150 note files with: - Problem description (examples, constraints) - Python code stub (function signature) - C++ code stub (function signature + includes) API responses cached in leetcode/.cache/leetcode/ for instant re-runs.
870 B
870 B
TODO 0052. N Queens II hard
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:
Input: n = 4
Output: 2
Explanation: There are two distinct solutions to the 4-queens puzzle as shown.Example 2:
Input: n = 1
Output: 1Constraints:
1 <= n <= 9
TODO Approach
Write your approach here.
TODO Python
class Solution:
def totalNQueens(self, n: int) -> int:TODO C++
class Solution {
public:
int totalNQueens(int n) {
}
};