Qm

Topic · Interview, Career & Industry

← All topics

Probability Puzzles

34 articles · 5 checkpoints · 17 deeper reads · 12 reference notes

Every article, in reading order

plant a flag as you finish each

Read these first

  1. Most "expected number of flips/steps until X" puzzles look intractable until you ask one question: what happens after the very first move, and can I write the answer in terms of itself?

  2. The expected value of a sum always equals the sum of the expected values, even when the pieces are wildly dependent on each other. That one fact quietly solves half the hard-looking counting puzzles in an interview.

  3. Candidate A beats candidate B in the final count, what's the chance A was strictly ahead for the entire tally, from the very first vote counted? A clever mirror-image trick turns a hard counting problem into simple subtraction.

  4. HTH and HHT are both three-flip patterns with 1/8 probability each, so why does one take longer, on average, to see than the other? The pattern's own internal structure is the hidden variable.

  5. Instead of building a state machine, imagine an army of gamblers betting on every flip, the optional stopping theorem turns their fair-game payouts into the waiting time itself, with almost no algebra.

Then the rest

Reference notes12 short entries