Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Valid Sudoku
Coding · Array · Hash Table · Matrix
- 0/1 Knapsack Problem with Time Complexity Optimization
Coding
- 01 Matrix
Coding
- 1 leetcode hard complex dp questions
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Confluent
Leetcode 37. Sudoku Solver
Reported Oct 14, 2026 · 3 source reports
SENIOR
Source snapshot: Nov 12, 2026
View source