# Vitter Reservoir Algorithm R: Interview Notes

Vitter Reservoir Algorithm R shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Keep the first k items, then replace a uniformly chosen reservoir slot with the j-th subsequent item with probability k/j.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n) time and O(k) space for a uniformly random sample of size k.

## Common mistake

Using probability k/n for every j, which over-samples early items.

## 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 interview assistant.