Sudoku Solver With Backtracking | Dataford Interview Questions

Solve the Sudoku solver problem using backtracking.

Implement solve_sudoku(board), where board is a 9x9 list of strings. Each cell contains a digit from "1" to "9" or "." for an empty cell. Modify the board in place and return the completed board. The input is guaranteed to have exactly one valid solution.

Constraints

board has exactly 9 rows and 9 columns
Each cell is "." or a digit from "1" to "9"
The initial board does not violate Sudoku rules
The board has exactly one valid solution
The function must modify the input board in place

Function Signature

def solve_sudoku(board):

Your question is Sudoku Solver With Backtracking. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Solve the Sudoku solver problem using backtracking.

Constraints

board has exactly 9 rows and 9 columns
Each cell is "." or a digit from "1" to "9"
The initial board does not violate Sudoku rules
The board has exactly one valid solution
The function must modify the input board in place

Function Signature

def solve_sudoku(board):

Your question is Sudoku Solver With Backtracking. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.