# Two Sum II: Walkthrough
Two Sum II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The array is already sorted, so walk left and right pointers inward: shrink the right side when the sum is too big and grow the left side when it is too small, until they meet at the pair.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Restarting a binary search from scratch for every left index, which is correct but slower than the two-pointer walk.
## 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.