N-queens placement count
Return the number of distinct ways to place n non-attacking queens on an n x n chessboard (no two share a row, column, or diagonal). 1 <= n <= 9.
Implement
n_queens_count(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 25 min
solution.py
InputExpectedGot
[4]2not run yetsample