Maximizing Urn Payout Strategy
Best strategy for drawing chips is a medium quant interview question on Expected Value, reported to have been seen at DRW and Jane Street.
MyQuantPartner is not affiliated with, endorsed by, or sponsored by these companies, and all trademarks belong to their respective owners.
This urn problem is a classic expected value question with a twist: you must make a second decision after seeing partial information. It sits at the intersection of probability, decision theory, and information usage, which makes it a staple in serious quant prep and a great proxy for how you think under uncertainty in quant interviews. You are effectively asked to turn an observed outcome into an updated belief about a hidden state and then choose a payoff-maximizing action.
Working through it trains conditional probability, Bayesian updating, and comfort with randomization over scenarios. It also reinforces translating a verbal description into precise probabilistic structure and comparing expected values of competing strategies. These are the same core reflexes you need when evaluating trading rules, risk allocations, or model choices.
This matters in quant interviews because real markets constantly reveal noisy information, and your edge comes from reacting correctly to it. Interviewers use such problems to see if you instinctively incorporate new data, update your mental model, and adjust your strategy rather than sticking to a naive plan. Strong performance on this kind of question signals readiness for more advanced quant interviews and systematic trading problems.
What it tests
This problem class is governed by conditional probability and Bayesian updating: when you observe an outcome from a random process (like drawing a \$1 chip), you gain information about the underlying state (which urn you picked), and you must update your beliefs accordingly. The optimal strategy is found by weighing the expected values of each possible action, conditioned on this updated information. The key is that the act of observing an outcome changes the probability distribution over the hidden variables (which urn you have), and thus alters the expected value of future actions. This is a general feature of problems where you make sequential choices with partial information: the first observation is not just a random event, but a clue about the underlying scenario, and your next move should exploit this new information. The principle holds because conditioning on observed outcomes reshapes the likelihood of each scenario, and thus the expected value of subsequent actions.
Practise this question with written feedback, or hear it in a spoken mock interview.
Get started free