Rat in a Maze Problem in DSA Python - Time & Space Complexity

Time Complexity: Rat in a Maze Problem

O(2^(2n))

Understanding Time Complexity

We want to understand how the time needed to solve the Rat in a Maze problem changes as the maze size grows.

Specifically, how does the number of steps the algorithm takes grow when the maze gets bigger?

Scenario Under Consideration

Analyze the time complexity of the following code snippet.

def solve_maze(maze, x, y, solution):
    n = len(maze)
    if x == n - 1 and y == n - 1:
        solution[x][y] = 1
        return True
    if 0 <= x < n and 0 <= y < n and maze[x][y] == 1:
        solution[x][y] = 1
        if solve_maze(maze, x + 1, y, solution):
            return True
        if solve_maze(maze, x, y + 1, solution):
            return True
        solution[x][y] = 0
        return False
    return False

This code tries to find a path from the top-left to the bottom-right of a maze using backtracking.

Identify Repeating Operations

Identify the loops, recursion, array traversals that repeat.

• Primary operation: Recursive calls exploring each cell in the maze.
• How many times: Potentially every cell is visited multiple times in different paths.

How Execution Grows With Input

As the maze size grows, the number of possible paths grows very fast because the rat can move right or down at each step.

Input Size (n)	Approx. Operations
2	Up to 22*2 = 16
3	Up to 22*3 = 64
4	Up to 22*4 = 256

Pattern observation: The operations grow exponentially as the maze size increases.

Final Time Complexity

Time Complexity: O(2^(2n))

This means the time needed can grow very fast, roughly quadrupling for each unit increase in maze size n.

Common Mistake

[X] Wrong: "The algorithm only checks one path, so it runs in linear time."

[OK] Correct: The algorithm tries many possible paths using recursion, so it explores many combinations, not just one.

Interview Connect

Understanding this problem helps you think about how recursive backtracking explores many options, which is useful for many puzzles and pathfinding tasks.

Self-Check

"What if the rat could move in all four directions instead of just right and down? How would the time complexity change?"

Practice

1. What is the main goal of the Rat in a Maze problem?

easy

A. Find a path from the start to the destination in a maze

B. Count the number of walls in the maze

C. Calculate the shortest distance between two points in a maze

D. Fill the maze with obstacles

Solution

1. Step 1: Understand the problem objective

   The Rat in a Maze problem asks to find a path from the start cell (usually top-left) to the destination cell (usually bottom-right) in a maze represented by a grid.

2. Step 2: Identify the correct goal

   The goal is to find a valid path through open cells, avoiding obstacles, not just counting walls or distances.

3. Final Answer:

   Find a path from the start to the destination in a maze -> Option A

4. Quick Check:

   Goal = Find path [OK]

Hint: Focus on pathfinding, not counting or measuring [OK]

Common Mistakes:

• Confusing pathfinding with counting obstacles
• Thinking the problem is about shortest path always
• Assuming the maze is always square

2. Which of the following is the correct way to check if the rat can move to cell (x, y) in Python?

easy

A. if x >= 0 and y >= 0 and maze[x][y] == 1:

B. if maze[x][y] == 1 and x >= 0 and y >= 0:

C. if maze[x][y] == 1 or x >= 0 or y >= 0:

D. if maze[x][y] != 1 and x > 0 and y > 0:

Solution

1. Step 1: Check boundary conditions first

   We must first ensure x and y are within valid indices (>= 0) before accessing maze[x][y] to avoid errors.

2. Step 2: Check if the cell is open (value 1)

   After confirming indices, check if maze[x][y] == 1 to confirm the cell is open for movement.

3. Final Answer:

   if x >= 0 and y >= 0 and maze[x][y] == 1: -> Option A

4. Quick Check:

   Check bounds before access [OK]

Hint: Check indices before accessing maze to avoid errors [OK]

Common Mistakes:

• Checking maze[x][y] before verifying indices
• Using 'or' instead of 'and' in conditions
• Checking for maze[x][y] != 1 instead of == 1

3. What will be the output of the following code snippet for the given maze?

maze = [
  [1, 0, 0, 0],
  [1, 1, 0, 1],
  [0, 1, 0, 0],
  [1, 1, 1, 1]
]

solution = [[0]*4 for _ in range(4)]

def solve_maze(x, y):
    if x == 3 and y == 3:
        solution[x][y] = 1
        return True
    if 0 <= x < 4 and 0 <= y < 4 and maze[x][y] == 1:
        solution[x][y] = 1
        if solve_maze(x + 1, y):
            return True
        if solve_maze(x, y + 1):
            return True
        solution[x][y] = 0
        return False
    return False

solve_maze(0, 0)
print(solution)

medium

A. [[1, 0, 0, 0], [1, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 1]]

B. [[1, 0, 0, 0], [1, 1, 0, 0], [0, 0, 0, 0], [0, 0, 0, 1]]

C. [[1, 0, 0, 0], [1, 1, 0, 0], [0, 1, 0, 0], [0, 1, 1, 1]]

D. [[1, 0, 0, 0], [1, 1, 0, 0], [0, 0, 0, 0], [1, 1, 1, 1]]

Solution

1. Step 1: Trace the recursive path from (0,0) to (3,3)

   The function tries moving down first, then right. It marks cells in solution as 1 when moving forward and backtracks by resetting to 0 if dead end.

2. Step 2: Follow the path and update solution matrix

   Path found is (0,0) -> (1,0) -> (1,1) -> (2,1) -> (3,1) -> (3,2) -> (3,3). These cells are marked 1 in solution.

3. Final Answer:

   [[1, 0, 0, 0], [1, 1, 0, 0], [0, 1, 0, 0], [0, 1, 1, 1]] -> Option C

4. Quick Check:

   Path marked correctly in solution [OK]

Hint: Follow recursion path and mark visited cells [OK]

Common Mistakes:

• Confusing backtracking reset steps
• Assuming right move tried before down
• Not marking the destination cell

4. Identify the error in the following code snippet for solving the Rat in a Maze problem:

def solve_maze(x, y):
    if x == len(maze) - 1 and y == len(maze[0]) - 1:
        solution[x][y] = 1
        return True
    if x >= 0 and y >= 0 and maze[x][y] == 1:
        solution[x][y] = 1
        if solve_maze(x + 1, y):
            return True
        if solve_maze(x, y + 1):
            return True
        solution[x][y] = 0
        return False
    return False

medium

A. The function does not backtrack properly

B. The boundary check misses upper limits for x and y

C. The base case does not mark the destination cell

D. The maze is not checked for obstacles

Solution

1. Step 1: Analyze boundary checks in the condition

   The condition 'if x >= 0 and y >= 0 and maze[x][y] == 1' misses checking if x and y are less than maze size, risking index errors.

2. Step 2: Confirm base case and backtracking correctness

   The base case marks destination cell and returns True. Backtracking resets solution[x][y] to 0 correctly. Maze obstacles are checked.

3. Final Answer:

   The boundary check misses upper limits for x and y -> Option B

4. Quick Check:

   Check both lower and upper bounds [OK]

Hint: Always check both lower and upper bounds for indices [OK]

Common Mistakes:

• Forgetting to check upper bounds causes errors
• Assuming base case is wrong when it is correct
• Ignoring backtracking step

5. Given a maze represented by a 2D list where 1 means open path and 0 means blocked, how would you modify the standard Rat in a Maze backtracking algorithm to find all possible paths from start to destination instead of just one?

hard

A. Return True immediately after finding the first path

B. Use a queue instead of recursion to find paths

C. Stop recursion when a path is found

D. Store each valid path in a list and continue searching after backtracking

Solution

1. Step 1: Understand standard algorithm behavior

   The standard algorithm returns True immediately after finding the first path, stopping further search.

2. Step 2: Modify to find all paths

   Instead of returning True immediately, store the current path in a list and continue exploring other paths by backtracking to find all possible routes.

3. Final Answer:

   Store each valid path in a list and continue searching after backtracking -> Option D

4. Quick Check:

   Collect all paths by continuing search [OK]

Hint: Collect paths and backtrack fully to find all [OK]

Common Mistakes:

• Stopping after first path found
• Not storing paths properly
• Confusing BFS queue with backtracking recursion