# Sudoku Solver Via Dancing Links: Interview Notes

Sudoku Solver Via Dancing Links shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Model each cell-value as an exact-cover row against column constraints for cells, rows, columns, and boxes, then run Algorithm X.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

Exponential worst case; fast on standard 9x9.

## Common mistake

Omitting the box constraints so locally valid rows still clash in a 3x3 block.

## 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 Linkjob AI interview assistant.