25 hard probability interview questions with answers
25 challenging original probability questions with answers on patterns, barrier hitting, hidden parameters, renewal sampling and martingale conditions.
How to approach these questions
Our bank labels a substantial subset of probability questions Hard. This editorial collection targets the reasons a problem becomes challenging: overlapping states, length-biased sampling, latent parameters and unjustified stopping arguments. It is not a measured ranking of the hardest questions or a claim about candidate failure rates. Attempt the setup before reading the explanation, then use the boundary or integrability check to test your own derivation.
Define the experiment
Specify whether draws use replacement, what is observed and whether variables are independent. A change in the observation protocol can change the answer even when the story sounds identical.
Choose the smallest useful tool
Try an indicator for a count, total expectation for a mixture and a state recurrence for a waiting problem. A carefully chosen state often removes pages of enumeration.
Check the answer
Probabilities must lie between zero and one, and waiting times must have the right units. Test symmetry and boundary cases before committing to the result.
A simple symmetric walk starts at 0 and is at 0 after 4 steps. What is the probability it was at 2 after 2 steps?
Answer: 1/6.
Explanation: Six equally likely step sequences return to zero. Only UUDD passes through 2 halfway; unconditional intermediate probabilities are inappropriate.
Continuous exits and renewal sampling
The generator supplies a boundary-value problem; time-based sampling reweights intervals by their lengths.
Standard Brownian motion starts at x in (0,a). What is the probability it hits a before 0?
Answer: x/a.
Explanation: Stop the bounded process on exiting the interval and use its martingale mean. The bounded stopped process justifies the stopping argument.
Every renewal interval lasts exactly 1 or 3 minutes with equal probability. At a stationary random time, what is expected length of the interval containing you?
Answer: 2.5 minutes.
Explanation: Time sampling weights intervals by length, giving probabilities 1/4 and 3/4. Thus the mean is E[L²]/E[L] = 5/2.
A Poisson process has rate 5 per hour. Independently mark each arrival red with probability 0.4. Are red and non-red counts in a fixed hour independent?
Answer: Yes; they are Poisson with means 2 and 3.
Explanation: Independent thinning splits a Poisson process into independent processes. Conditioning on their total would instead make the counts dependent.
Processes, tails and integrability
Check whether a seemingly symmetric answer has a finite expectation and whether a stopping time supports the claimed identity.
A fair integer random walk starts at 0 and stops when it first reaches 1. Is its expected stopping time finite?
Answer: No, although it reaches 1 almost surely.
Explanation: Almost-sure finiteness does not imply finite expectation. An unbounded stopping argument cannot simply transfer the martingale mean to this time.
Bounds, branching and exponential races
Distinguish a sharp calculation from a bound, and select the correct fixed point or event sequence.
Each individual has zero children with probability 0.4 and two with probability 0.6, independently. What is the extinction probability from one ancestor?
Answer: 2/3.
Explanation: The extinction probability is the smallest root in [0,1] of q = 0.4 + 0.6q². The other root, 1, is not the extinction probability here.
A coin has uniform prior for p. After 3 heads and 1 tail, let X and Y indicate heads on two future conditionally independent tosses. Find their posterior predictive covariance.
Answer: 2/63.
Explanation: The posterior is Beta(4,2). Conditional covariance is zero, so total covariance equals Var(p | data) = 4 × 2/(6² × 7). Shared uncertainty couples the future tosses.
Three independent exponential clocks have common rate λ. Find the expected last ring time.
Answer: 11/(6λ).
Explanation: Successive gaps have rates 3λ, 2λ and λ by memorylessness. Add their means, rather than multiplying the largest mean by three.
What our question-bank data shows
Our bank summary dated contains 124 probability entries labelled Hard in the bank. Counts describe entries in our curated practice bank, including its source and classification choices. They do not measure employer interview frequency, candidate success rates or how often any one question is asked.
These 124 entries represent 13.4% of the 928 probability entries in our bank.
Difficulty labels come from the bank classification; they are not based on candidate completion or failure rates.
The public examples above were written for these guides. They illustrate the techniques and are not a reproduction or ranking of the bank's sourced questions. “Hard” is an editorial bank label, not a measured difficulty score. The dashboard's broader bank combines sourced questions, worked answers where available and references for book entries without a reproduced solution.
Lessons behind the techniques
Use these lesson previews to find the definitions and derivations behind the worked examples.