CT050
Sudoku Solver
HardAcceptance: 0.0%
Sudoku is a puzzle on a 9x9 grid partially filled with digits 1-9. Fill the grid so every row, column, and 3x3 box contains all digits 1-9. Given a 9x9 Sudoku grid (0 for empty), output the solved grid as 9 lines of 9 digits each.
Example 1:
Input: 5 3 0 0 7 0 0 0 0
6 0 0 1 9 5 0 0 0
0 9 8 0 0 0 0 6 0
8 0 0 0 6 0 0 0 3
4 0 0 8 0 3 0 0 1
7 0 0 0 2 0 0 0 6
0 6 0 0 0 0 2 8 0
0 0 0 4 1 9 0 0 5
0 0 0 0 8 0 0 7 9
Output: 5 3 4 6 7 8 9 1 2
6 7 2 1 9 5 3 4 8
1 9 8 3 4 2 5 6 7
8 5 9 7 6 1 4 2 3
4 2 6 8 5 3 7 9 1
7 1 3 9 2 4 8 5 6
9 6 1 5 3 7 2 8 4
2 8 7 4 1 9 6 3 5
3 4 5 2 8 6 1 7 9
Constraints:
Grid is 9x9 with valid puzzle (unique solution exists) 0 represents empty cell
Tags:
backtracking recursion matrix
Loading...
Test Cases:No test cases
No test cases available.