# Diagonal Traverse II: Explained
Diagonal Traverse II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
nums is a ragged list. Group values by r+c (those are the diagonals) and emit groups in increasing r+c, each group from bottom-left to top-right (larger r first). A hashmap of queues or a bucket list works.
## 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(total cells).
## Common mistake
Assuming a rectangular matrix and reading out-of-range indices.
## 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.