N-queens count
The n-queens puzzle places n queens on an n x n chessboard so that no two attack each other (no shared row, column, or diagonal). Given an integer n (1..12), return the number of distinct solutions. Return an integer.
Implement
total_n_queens(n: int) → intExamples
in
[4]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[4]2not run yetsample