# Rotate List: Interview Notes
Rotate List shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Compute length n, k %= n, then connect tail to head and walk n-k steps to the new tail, cutting there so the next node becomes the new head.
## 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
Rotating by k without taking k modulo n, which walks off the list when k >= n.
## 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 undetectable AI interview copilot.