Sudoku Solver Using Backtracking in DSA C# - Time & Space Complexity

Time Complexity: Sudoku Solver Using Backtracking

O(9^n)

Understanding Time Complexity

We want to understand how the time needed to solve a Sudoku puzzle grows as the puzzle size or difficulty changes.

Specifically, how the backtracking method's steps increase with more empty cells.

Scenario Under Consideration

Analyze the time complexity of the following Sudoku solver using backtracking.

bool SolveSudoku(int[,] board) {
  for (int row = 0; row < 9; row++) {
    for (int col = 0; col < 9; col++) {
      if (board[row, col] == 0) {
        for (int num = 1; num <= 9; num++) {
          if (IsSafe(board, row, col, num)) {
            board[row, col] = num;
            if (SolveSudoku(board)) return true;
            board[row, col] = 0;
          }
        }
        return false;
      }
    }
  }
  return true;
}
    

This code tries numbers 1 to 9 in empty cells, checking if placing a number is safe, and uses recursion to fill the board.

Identify Repeating Operations

Look at what repeats most in this code.

• Primary operation: Trying numbers 1 to 9 in each empty cell and checking if safe.
• How many times: For each empty cell, up to 9 attempts, and recursive calls for next cells.

How Execution Grows With Input

The number of empty cells affects how many guesses and backtracks happen.

Empty Cells (n)	Approx. Operations
10	Up to 9^10 (about 3.5 billion) tries in worst case
20	Up to 9^20 (very large, trillions of trillions)
30	Up to 9^30 (astronomically large)

Pattern observation: The operations grow exponentially with the number of empty cells.

Final Time Complexity

Time Complexity: O(9^n)

This means the time needed can grow very fast as the number of empty cells increases, because each cell can try up to 9 numbers recursively.

Common Mistake

[X] Wrong: "The solver always tries exactly 9 numbers per empty cell."

[OK] Correct: Actually, many numbers are quickly ruled out by the safety check, so fewer tries happen in practice, making the solver faster than the worst case.

Interview Connect

Understanding this exponential growth helps you explain why backtracking is powerful but can be slow, and shows your grasp of recursive problem solving.

Self-Check

"What if we changed the board size from 9x9 to 16x16? How would the time complexity change?"

Practice

1. What is the main purpose of using backtracking in a Sudoku solver?

easy

A. To try possible numbers and undo choices if they lead to conflicts

B. To randomly fill the Sudoku grid without checking rules

C. To sort the numbers in each row before solving

D. To count how many empty cells are in the Sudoku grid

Solution

1. Step 1: Understand backtracking role

   Backtracking tries numbers in empty cells and removes them if they cause conflicts.

2. Step 2: Compare other options

   Options A, B, and C do not describe backtracking's trial and error approach.

3. Final Answer:

   To try possible numbers and undo choices if they lead to conflicts -> Option A

4. Quick Check:

   Backtracking = Try and undo choices [OK]

Hint: Backtracking means try and undo wrong choices [OK]

Common Mistakes:

• Thinking backtracking fills randomly without checks
• Confusing backtracking with sorting or counting
• Ignoring the undo step in backtracking

2. Which C# syntax correctly defines a method header for a Sudoku solver using backtracking that returns a boolean?

easy

A. public bool SolveSudoku(int[,] board)

B. bool SolveSudoku(int[][] board)

C. public void SolveSudoku(int[] board)

D. bool SolveSudoku(int[] board);

Solution

1. Step 1: Check method signature correctness

   public bool SolveSudoku(int[,] board) uses correct C# syntax: public access, bool return, 2D array parameter.

2. Step 2: Identify errors in other options

   bool SolveSudoku(int[][] board) uses wrong array syntax for C#, C uses void return instead of bool, D has semicolon ending which is invalid for method definition.

3. Final Answer:

   public bool SolveSudoku(int[,] board) -> Option A

4. Quick Check:

   Correct C# method header = public bool SolveSudoku(int[,] board) [OK]

Hint: Use public bool with int[,] for 2D arrays in C# [OK]

Common Mistakes:

• Using jagged array syntax int[][] instead of int[,]
• Missing public keyword or wrong return type
• Ending method header with semicolon

3. What will be the output of the following code snippet when trying to solve a partially filled Sudoku board?

int[,] board = new int[9,9] {
 {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}
};
SudokuSolver solver = new SudokuSolver();
bool solved = solver.SolveSudoku(board);
Console.WriteLine(solved);

medium

A. false

B. true

C. Compilation error

D. Runtime exception

Solution

1. Step 1: Understand the input board

   The board is a valid partially filled Sudoku puzzle with zeros as empty cells.

2. Step 2: Analyze SolveSudoku method behavior

   Assuming correct backtracking implementation, the solver will find a solution and return true.

3. Final Answer:

   true -> Option B

4. Quick Check:

   Valid puzzle solved = true [OK]

Hint: Valid puzzles return true after solving [OK]

Common Mistakes:

• Assuming zeros cause errors instead of empty cells
• Thinking solver returns false without trying all options
• Confusing compilation/runtime errors with logic

4. Identify the bug in this backtracking Sudoku solver snippet:

bool IsSafe(int[,] board, int row, int col, int num) {
  for (int x = 0; x < 9; x++) {
    if (board[row, x] == num || board[x, col] == num) return false;
  }
  int startRow = row - row % 3;
  int startCol = col - col % 3;
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
      if (board[startRow + i, startCol + j] == num) return false;
    }
  }
  return true;
}

medium

A. The method does not check if the cell is already filled

B. The row and column checks are incomplete

C. No bug; the method correctly checks safety

D. The 3x3 box check uses wrong start indices calculation

Solution

1. Step 1: Review row and column checks

   The method checks all cells in the row and column for the number, which is correct.

2. Step 2: Review 3x3 box check

   Calculates startRow and startCol correctly using modulo, then checks all 3x3 cells.

3. Step 3: Confirm no missing checks

   Method returns true only if no conflicts found, so it is correct.

4. Final Answer:

   No bug; the method correctly checks safety -> Option C

5. Quick Check:

   Safety check correct = No bug; the method correctly checks safety [OK]

Hint: Check row, column, and 3x3 box carefully [OK]

Common Mistakes:

• Miscomputing start indices for 3x3 box
• Forgetting to check both row and column
• Assuming cell fill check is needed here

5. Given a Sudoku board with multiple empty cells, which strategy improves the backtracking solver's efficiency the most?

hard

A. Fill cells randomly to reduce search space

B. Always try numbers 1 to 9 in order without checks

C. Skip checking 3x3 boxes to save time

D. Choose the empty cell with the fewest possible valid numbers first

Solution

1. Step 1: Understand backtracking efficiency

   Choosing the cell with fewest valid options reduces branching and speeds solving.

2. Step 2: Evaluate other options

   Random filling (A) wastes time, trying numbers blindly (B) is inefficient, skipping box checks (D) breaks rules.

3. Final Answer:

   Choose the empty cell with the fewest possible valid numbers first -> Option D

4. Quick Check:

   Minimum options first = faster solving [OK]

Hint: Pick cell with fewest options first to speed solving [OK]

Common Mistakes:

• Trying numbers in fixed order without heuristics
• Ignoring 3x3 box constraints
• Randomly filling cells hoping for quick solve