Multi-Stage Coin Flip Expectation Trick
Expected Heads After Reflipping Coin Pairs is a medium quant interview question on Combinatorics, reported to have been seen at Jane Street.
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 small stochastic system where you repeatedly apply a simple local rule that can change the global configuration. It sits at the intersection of combinatorics and probability, with a discreet state space that evolves randomly but according to clear rules. In a quant prep context, it teaches you to read a dynamic puzzle and immediately see the hidden Markov-style structure underneath the story.
It trains your comfort with recursive expectations, conditioning on the current state, and expressing one unknown expectation in terms of others. You must manage a finite state space, track transitions and probabilities, and recognize when a process effectively becomes an absorbing Markov chain. It also sharpens your ability to compress symmetry and reduce redundant cases.
This matters for quant interviews because trading, risk, and derivatives problems often involve repeated random actions, stopping rules, and payoffs defined at termination. Interviewers want to see if you can build and manipulate expectation equations under dynamic rules, not just plug into closed-form formulas. Performing well on this kind of question signals that you can reason about evolving positions, path dependence, and long-run payoffs under uncertainty, which are central in front-office quantitative roles.
What it tests
This problem class is governed by recursive expectation and the law of total expectation, especially when a process can repeat itself based on the outcome of random events. The key structure is that the process splits into cases depending on the current state (such as the number of tails), and the expected value at each state can be expressed in terms of the expected values of future states. This recursive structure arises because after each random event, the process may either terminate or continue with a new, but similar, subproblem. The reason this works is that expectation is linear and unaffected by the path taken: the expected value at any stage is a weighted sum of the possible next states' expected values, weighted by their probabilities. This allows you to build up the overall expectation by conditioning on the current state.
Practise this question with written feedback, or hear it in a spoken mock interview.
Get started free