Skip to content

Latest commit

 

History

History
16 lines (12 loc) · 624 Bytes

File metadata and controls

16 lines (12 loc) · 624 Bytes

Problem 7: The Sudoku Solver (Solve Sudoku)

Problem Statement

Write a program to solve a Sudoku puzzle by filling the empty cells. A sudoku solution must satisfy all of the following rules:

  1. Each of the digits 1-9 must occur exactly once in each row.
  2. Each of the digits 1-9 must occur exactly once in each column.
  3. Each of the digits 1-9 must occur exactly once in each of the 9 3x3 sub-boxes.

The '.' character indicates empty cells.

Input Format

  • A 9x9 board with characters from '1'-'9' and '.'.

Example

Input: A partially filled 9x9 Sudoku grid
Output: The completed valid Sudoku grid