Sudoku Solver · Coding Interview Practice

Sudoku SolverFill the empty cells ('.') of a 9x9 Sudoku board so that every row, every column and every 3x3 sub-box contains the digits 1-9 exactly once. The input always has exactly one solution.Constraints

board.length == 9 and board[i].length == 9

board[i][j] is a digit '1'-'9' or '.'

The puzzle has exactly one solution

Examples

Input: board = a valid partially filled 9x9 grid Output: the same grid with every cell filled

Input: board = a grid with a single empty cell Output: the grid with that cell completed

Practise this challengeAll coding challenges

LetsDiscuss

Loading your session…