# Spiral Matrix III: Practice Notes

Spiral Matrix III shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Start at (rStart, cStart) in rows x cols and walk an east-facing spiral that lengthens every two turns (1,1,2,2,3,3,...). Record a coordinate whenever it lands inside the grid until you have every cell.

## 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(max(rows, cols)^2).

## Common mistake

Growing the step length every turn instead of every two turns, or stopping at the bounding box.

## 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 help for online coding assessments.