# Swap Nodes In Pairs: Walkthrough
Swap Nodes In Pairs shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Dummy head: take two nodes at a time and rewire a->b->rest into b->a->rest, then advance the prev pointer to a. Recursion does the same after swapping the first pair.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (linked-list rewiring, two pointers, or a monotonic stack) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Swapping values instead of pointers when the follow-up asks you not to, or losing the rest of the list.
## 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 real-time AI interview assistant for live interviews.