Probability Interview Questions
Probability questions in quant interviews cluster into six recurring flavors: Bayesian updating, conditional-probability puzzles, combinatorial counting, coin games and random walks, geometric probability, and distribution or simulation tricks.
The common thread: define the sample space, condition on exactly what you observed, and the arithmetic collapses.
Last updated 2 July 2026 · sub-areas, difficulty mix and firm attributions are compiled directly from the 510 probability problems in the QuantVault bank; firm tags are candidate-reported, not employer-verified, and no individual author is named in our source data.
- Core sub-areas
- Bayesian updating · conditional probability · counting · coin games & random walks · geometric probability · distributions & simulation
- Typical difficulty
- Centered on medium — 179 easy, 261 medium and 70 hard across the 510-problem set
- Who leans on it
- Every quant loop — heaviest candidate tags: SIG, Jane Street, Citadel, Optiver, Two Sigma
- Practice pool
- 510 problems in the bank · 113 free to open with the full worked solution
Where probability shows up: at every stage — OAs screen it under time pressure, phone rounds probe one puzzle in depth, onsites push variants until the pattern breaks. For how it sits inside specific funnels, see the SIG interview questions guide and the Jane Street interview questions guide.
The surfaceThe probability sub-areas quant interviews test
Six families cover essentially every probability question in the bank. Each row pairs a sub-area with its recurring question shape and a representative type — a flavor drawn from real problems, never a leaked wording.
| Sub-area | Recurring shape | Representative type (flavor, not a real question) |
|---|---|---|
| Bayesian updating & posteriors | Turn a prior and an observation into posterior odds | A mystery-coin or unreliable-witness setup where the evidence moves the odds far less than intuition says. |
| Conditional probability & total probability | Re-count the worlds that survive the information | A Monty Hall variant or marble-transfer question whose answer flips once a door opens or a draw is revealed. |
| Counting & combinatorial probability | Favorable over total, without double-counting | A poker-hand, seating or derangement question where the whole battle is a clean count. |
| Coin games, pattern races & random walks | Condition on the first step and let the recursion close | A gambler's-ruin or HTH-vs-HHT race where the naïve “equally likely” guess loses to first-step analysis. |
| Geometric probability | Turn randomness into an area ratio | A broken-stick or points-on-a-circle question where the probability is the area of a region you draw first. |
| Distributions, simulation & bounds | Recognize the distribution, transform it, or bound its tail | A “generate one uniform from another” construction, a Poisson limit, or a tail bound where choosing the tool is the question. |
What's confirmed vs. what varies: the sub-areas and difficulty mix come straight from the problem set, so they are stable. Which firm asks which flavor is candidate-reported through problem tags — treat firm attributions as directional.
The patternsSignature probability question patterns
Three moves generate most correct answers in this topic. Each worked box is a 60–90 second micro-example — the reasoning template, applied to a generic setup rather than any firm's wording.
Bayesian updating — work in odds, respect the base rate
Takeaway: posterior odds = prior odds × likelihood ratio. Strong evidence against a tiny prior often lands near a coin flip.
Shape. A jar holds 1,000 coins; one is double-headed, the rest fair. You draw one and flip 10 heads. Is it the double-headed coin?
1. Set the prior odds. Before flipping: 1 : 999 against the double-headed coin.
2. Weigh the evidence. Ten heads has probability \(1\) for the double-headed coin and \(2^{-10}\) for a fair one, so the likelihood ratio is \(1024\). Posterior odds: \(1024 : 999\).
3. Convert back. \(P = 1024/(1024+999) = 1024/2023 \approx 0.51\) — ten straight heads, and it is still barely better than a coin flip. The move: never multiply the evidence without first stating the prior.
Random walks — let an invariant replace the path count
Takeaway: in a fair game your expected bankroll never moves — one line of bookkeeping replaces an infinite sum over paths.
Shape. You hold \(a\) dollars, your opponent \(b\). You bet $1 on a fair coin until one side is broke. What is the probability you take everything?
1. Spot the invariant. Each bet is fair, so your expected bankroll stays \(a\) at every step — including at the end.
2. List the endings. The game ends at \(a+b\) (you win, probability \(p\)) or at \(0\). So \(p\,(a+b) = a\).
3. Read it off. \(p = a/(a+b)\) — the richer side usually wins a fair fight. The move: this shortcut needs the fair-coin assumption; a biased coin turns the answer into a \((q/p)^k\) ladder via first-step analysis.
Geometric probability — the answer is an area you draw
Takeaway: for continuous randomness, translate the event into constraints on the coordinates and compute an area — the picture is the proof.
Shape. A stick is broken at two uniformly random points. What is the probability the three pieces form a triangle?
1. Translate the event. Pieces form a triangle exactly when no piece exceeds half the stick — the triangle inequality in disguise.
2. Draw the sample space. The cut points \((x,y)\) fill the unit square; each “no piece > ½” constraint slices away a corner.
3. Measure it. The surviving region has total area \(\tfrac14\). The move: draw the region first — the integral is usually just geometry.
Free practiceProbability practice questions by sub-area
The bank holds 510 probability problems, 113 of them free (33 easy, 67 medium, 13 hard). The 40 below span every sub-area in the table, ordered easy → hard within each group; the interactive playlist carries the full free set.
Bayesian updating & posteriors
- Bertrand's Box ParadoxBayes' ruleeasyfree
- Two Children and a BoyEvidence pinningeasyfree
- Monty Hall With 100 DoorsPosterior intuitioneasyfree
- Bayesian Coin IdentificationPosterior oddseasyfree
- Probability of Truth Given CorroborationWitness updatingmediumfree
- Posterior Fair Value from Noisy SignalSignal updatingmediumfree
- Posterior Return Probability with Binary Regime IndicatorsMultiple signalsmediumfree
Conditional probability & total probability
- Conditional Probability Under Sample Space ReductionSample-space cuteasyfree
- Marble Transfer: Conditional ProbabilityTotal probabilityeasyfree
- The Other Ball in the BoxConditioning trapeasyfree
- Generalized Monty Hall: n DoorsInformation revealmediumfree
- Aces Before Kings: Probability via ExchangeabilityExchangeabilitymediumfree
- Conditional Marble Draw with Three ColorsCase splitmediumfree
- Probability the Last Die Roll Is Two When Summing Past 100Renewal insighthardfree
Counting & combinatorial probability
- Probability Two Friends Sit Adjacent in a RowArrangementseasyfree
- Birthday ProblemComplement counteasyfree
- Probability of Four of a Kind in a 5-Card Poker HandCard countingeasyfree
- Probability No One Gets Their Own HatDerangementsmediumfree
- Probability of a Void Suit in a Card HandInclusion-exclusionmediumfree
- Probability a Group Sits Together at a Circular TableCircular countinghardfree
- Probability That All Faces Appear in Consecutive RollsInclusion-exclusionhardfree
Coin games, pattern races & random walks
- Pattern Race: HTH vs HHTPattern racemediumfree
- HHT Before THH in Coin FlipsFirst-step analysismediumfree
- Gambler's Ruin on a Fair CoinRuin probabilitymediumfree
- Winning From Deuce With a Weaker ServeRecursive statesmediumfree
- Biased Random Walk Reaching Position 1Biased walkmediumfree
- Race to Three HeadsFirst-passagehardfree
- Hitting a Fixed Target with a Growing DieFirst-passagehardfree
Geometric probability
- Two Marks in the Same RegionRegion countingeasyfree
- Breaking a Stick into a TriangleArea ratiomediumfree
- Probability a Random Triangle Contains the Center of a CircleSymmetrymediumfree
- Probability a Three-Legged Disk Table StandsArc argumentmediumfree
- Five Points on a HemisphereClever conditioninghardfree
Distributions, simulation & bounds
- Probability of More Heads Than Tails With Odd FlipsSymmetryeasyfree
- Poisson Limit of Lottery WinnersPoisson limitmediumfree
- Generate Uniform 1-7 from Uniform 1-5Rejection samplingmediumfree
- Simulating a 2:3 Odds Ratio with Fair CoinsSimulation trickmediumfree
- Monte Carlo Estimation of Pi and eMonte Carlomediumfree
- Tightest Moment Bound on a Tail ProbabilityTail boundshardfree
- Joint Normal Conditional ProbabilityJoint normalhardfree
The planHow to prepare for probability questions
Six techniques to make reflexive, in the order they pay off. Each maps onto one of the practice groups above.
- Make Bayes-by-odds automatic. Prior odds × likelihood ratio = posterior odds — one line, no denominators. Every witness, mystery-coin and noisy-signal problem is this identity with different numbers.
- Pin down what the evidence rules out. The classic traps (boy-girl, Monty Hall, the other ball) are failures to specify how you learned what you learned. Say the conditioning event out loud before computing.
- Count with structure, not enumeration. Reach for the complement, inclusion-exclusion or a symmetry argument before any brute-force listing — interviewers grade the counting strategy, not the arithmetic.
- Learn the random-walk toolkit. First-step conditioning, absorbing states and the fair-game invariant crack gambler's ruin, pattern races and first-passage questions with the same three lines.
- Draw continuous problems. Set coordinates, translate the event into constraints, compute an area — then sanity-check against an extreme case.
- Keep the simulation tricks loaded. Rejection sampling and bit-by-bit constructions turn one distribution into another. Then run the free practice set and take the interactive probability playlist on a clock.
FAQProbability interview questions — frequently asked
How important is probability for quant interviews?
It is the default quant-interview subject — and the deepest section of our bank at 510 problems. Most other topics, from expected value to statistics, run on the same conditioning machinery, so a weak foundation here shows up everywhere at once.
What probability topics should I focus on?
Conditional probability and Bayesian updating first — they tag more problems in this set than any other technique. Then counting, the random-walk toolkit, and geometric probability for continuous setups.
How hard are probability interview questions?
Centered on medium: the 510-problem set splits into 179 easy, 261 medium and 70 hard. The hard tail rarely demands heavier math — it demands recognizing which canonical framing applies before the clock runs out.
Are these real quant interview questions?
They are representative, not verbatim. The problems are curated from our bank to match the shapes candidates report, rewritten for clarity with worked solutions we author ourselves — we never claim any wording is a leaked question.