Leetcode 37. Sudoku Solver

Fill the 9x9 Sudoku board by replacing '.' so each digit 1–9 appears exactly once in every row, column, and 3x3 sub-box. This is a constraint-satisfaction problem typically solved with backtracking/DFS and pruning across row, column, and box constraints (input has a unique solution).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 37. Sudoku Solver

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact