Design Sudoku
A Backtracking Problem
-
Algorithms and Data Structures: TheAlgorist.com
-
System Design: DistributedComputing.dev
-
Low Level Design: LowLevelDesign.io
-
Frontend Engineering: FrontendEngineering.io
Problem Statement:
Given a Sudoku, design an algorithm to solve it.
A sudoku solution must satisfy all of the following rules:
- Each of the digits 1-9 must occur exactly once in each row.
- Each of the digits 1-9 must occur exactly once in each column.
- Each of the digits 1-9 must occur exactly once in each of the nine 3x3 sub-boxes of the grid.
The '0' character indicates empty cells.
Solution in Java and Python:
This is a Premium Content.
Please subscribe to Low Level Design course to access the content.
Instructor:
If you have any feedback, please use this form: https://thealgorists.com/Feedback.
