# N Queens II: Practice Notes

N Queens II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Count solutions: place one queen per row and track occupied columns plus both diagonals as bitsets (col, diag, anti).

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (bitmasks, backtracking with pruning, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n!) pruned.

## Common mistake

Building the board strings (N-Queens I) when the problem only asks for the count.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at multilingual AI interview assistant.