# Weighted Random Pick With Prefix Sums: Interview Notes

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

## Key idea

Build cumulative weights, draw a uniform number in 0, total), and binary search the first prefix greater than it.

## 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) build, O(log n) per pick.

## Common mistake

Off-by-one in the search so the last bucket is never chosen.

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