# Matrix Cells In Distance Order: Interview Notes
Matrix Cells In Distance Order shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Return all cells of a rows x cols matrix sorted by Manhattan distance from (rCenter, cCenter). BFS from the center (buckets by distance) or generate all cells and sort by |r-rCenter|+|c-cCenter|.
## 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(rc log rc) sort or O(rc) BFS.
## Common mistake
Using Euclidean distance, or omitting some cells when the BFS bounds are wrong.
## 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 Linkjob AI copilot.