10-Sided Die Faces Expectation

This classic quant interview question is framed as a simple dice experiment but is fundamentally about the general coupon collection framework. The setup hides a rich expected value structure behind a familiar random process, which is why it often appears in strong quant prep material. In quant interviews, it serves as a compact way to see whether a candidate recognizes standard stochastic models in everyday wording.

It trains your command of expectation in discrete settings, your comfort with geometric-like waiting times, and your ability to translate an intuitive sampling story into a clean probabilistic model. It also reinforces working with series that arise naturally in probability and recognizing how they scale with the size of the state space.

This matters for quant interviews because many real problems in trading, risk, and data analysis reduce to understanding rare events and coverage of states. Interviewers use it to see whether you can generalize from a toy model to broader quant finance situations and reason precisely under randomness.

What it tests

The core structure here is the coupon collector's problem, which models the process of collecting all types from a set of $n$ distinct items, where each trial yields a random item uniformly. The expected number of trials to collect all types is governed by the sum of the reciprocals of the remaining unseen types, scaled by the total number of types: $n \sum_{k=1}^n \frac{1}{k}$. This arises because, after collecting $k-1$ unique items, the probability that the next trial yields a new type is $\frac{n-(k-1)}{n}$, so the expected waiting time for the next new type is $\frac{n}{n-(k-1)}$. This pattern holds because each new type becomes progressively rarer as more are collected, making the last few types the hardest to find. The principle generalizes to any scenario where you repeatedly sample from a finite set and seek to observe every possible outcome at least once.