# Random Pick With Weight: Interview Notes

Random Pick With Weight shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Build a prefix-sum of the weights and binary-search a uniform random integer in [1, total] to pick the matching bucket.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (two pointers, a sliding window, prefix sums, a monotonic stack, or binary search on the answer) and why a linear nested scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(log n) per pick after O(n) preprocess.

## Common mistake

Picking index i with probability proportional to 1/n instead of w[i].

## 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 this tool.