# The Maze II: Practice Notes

The Maze II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Dijkstra/BFS on stopping cells: from each stop, roll in four directions until a wall and record the distance if it improves.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(mn log(mn)) with a heap, or 0-1 BFS.

## Common mistake

BFS that treats every empty cell as a node, which does not match the 'cannot stop mid-roll' rule.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI assistant for technical interviews.