# Swapping Nodes In A Linked List: Interview Notes
Swapping Nodes In A Linked List shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Find the k-th node from the head and the k-th from the tail (two pointers), then swap their values (or rewire the four neighbor pointers if values cannot move).
## 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 the nodes' next pointers without also fixing the previous nodes, which can cycle 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 Linkjob AI interview assistant.