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).