# The Maze: Explained
The Maze shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A ball rolls in one of four directions until it hits a wall, then may choose a new direction. BFS on stopping cells (not every empty cell) from the start; a neighbor is the cell just before the wall in that direction.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(mn).
## Common mistake
Stepping one cell at a time like a normal grid BFS, which lets the ball stop in the middle of a corridor.
## 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 www.linkjob.ai.