66/100 Penalty Streak Odds
Probability of Scoring 66 out of 100 Penalties is a hard quant interview question on Conditional Probability, reported to have been seen at Citadel.
MyQuantPartner is not affiliated with, endorsed by, or sponsored by these companies, and all trademarks belong to their respective owners.
This quant interview question is about a self-reinforcing probability process, where the chance of future success depends on past performance. It lives at the intersection of conditional probability, stochastic processes, and combinatorics, and is a classic example of how path-dependent rules can sometimes lead to surprisingly simple final distributions. In quant prep, it exposes candidates to processes that resemble adaptive or learning systems.
It trains your ability to formalize reinforcement dynamics, recognize hidden structure in seemingly path-dependent systems, and derive a final probability law from a recursively defined process. You must keep track of evolving probabilities and still reason cleanly about the distribution of outcomes after many steps.
This matters for quant interviews because real trading and risk models often feature feedback: performance affects exposure, and exposure affects future performance. Questions like this test whether you can handle nontrivial dependencies, reason under uncertainty, and translate an adaptive rule into a tractable probabilistic statement, all under time pressure in a high-level quant interview setting.
What it tests
This problem class is governed by the principle of self-reinforcing (or self-referential) stochastic processes, where the probability of success at each step depends on the cumulative outcomes so far. These processes often exhibit a kind of 'path independence' in the final distribution: the probability of ending with a certain number of successes depends only on the total number of trials and initial conditions, not on the sequence of successes and failures. This is because, for each possible sequence leading to a given final count, the product of the evolving probabilities over the path, when summed over all such paths, yields a simple combinatorial expression. The reason this pattern holds is that the process is a variant of Pólya's urn, where the reinforcement mechanism ensures that the probability of a particular outcome sequence is proportional to the number of ways to arrange the successes and failures, weighted by the evolving probabilities, which ultimately collapse into a simple ratio.
Practise this question with written feedback, or hear it in a spoken mock interview.
Get started free