Blue Orb Conversion Expected Draws
Expected draws until all orbs blue is an easy quant interview question on Expected Value, 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 expected value question is a compact example of a discrete-time stochastic process where the system's composition evolves with each random draw and replacement. It sits at the intersection of basic probability, Markov chain intuition, and stopping-time reasoning, all staples of quant prep and quant interviews. Despite the simple wording, it hides a structured way of thinking about state changes over time.
It trains your ability to decompose a multi-step random evolution into stages, associate each stage with a success probability, and link that to an expected waiting time. You must be comfortable with geometric distributions, linearity of expectation, and identifying the relevant states of the system without getting lost in combinatorics.
This matters for quant interviews because many real trading and risk problems involve sequential random events and hitting times. Interviewers want to see if you can translate a dynamic probabilistic story into a clean expectation framework, reason about conversions or hits in stages, and compute a stopping time efficiently. It reflects how you will think about convergence, execution, and risk scenarios in a quantitative finance role.
What it tests
Whenever a process involves repeatedly performing random trials to convert all members of a set from one state to another, and each trial changes the state of at most one member, the total expected time can often be decomposed into stages, each corresponding to reducing the number of 'unconverted' items by one. At each stage, the probability of success (i.e., converting an item) depends on the current composition of the set, and the expected number of trials for that stage is the reciprocal of the success probability (from the geometric distribution). The linearity of expectation allows you to sum the expected times for each stage, regardless of the dependencies between them. This structure holds because each stage is memoryless: the expected time to the next conversion depends only on the current state, not the path taken to reach it.
Practise this question with written feedback, or hear it in a spoken mock interview.
Get started free