# Linked List Random Node: Explained
Linked List Random Node shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Reservoir sampling: walk the list once, at index i replace the chosen node with probability 1/(i+1). Works when you do not know the length up front.
## 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) per pick, extra O(1).
## Common mistake
Picking uniformly from a cached array, which uses extra O(n) memory the follow-up wants you to avoid.
## 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 AI job search and interview copilot.