# Flatten 2D Vector: Walkthrough

Flatten 2D Vector shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Keep an outer row index and an inner column index. Before next() or hasNext(), advance past empty rows so the pointer always rests on a real element.

## 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(1) amortized per call.

## Common mistake

Copying everything into one flat list up front, or crashing on empty inner rows.

## 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.