Betting Orbs Expected Value

Expected value guessing colored orbs is a medium quant interview question on Games, reported to have been seen at Jane Street.

Difficulty Medium Topic Games Reported 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 puzzle is about making sequential predictions in a simple, finite game where your information improves with every move. It wraps game theory, probability, and decision-making under uncertainty into a compact scenario that looks easy but hides subtle structure, ideal for serious quant prep and for training fast intuition under pressure during interviews.

It trains conditional probability, adaptive strategies, and expected value reasoning in a dynamic setting. Candidates must keep track of evolving states, reason about path-dependent outcomes, and evaluate optimal decisions when each step changes the future landscape. This kind of question also sharpens your ability to translate a word problem into a clean probabilistic model.

It matters for quant interviews because trading, risk, and market making are full of similar sequential decisions with feedback. Top firms use this style of question to test whether you can update beliefs quickly, optimize expected returns, and stay precise under uncertainty. Being fluent with these game-like problems is essential for strong quant prep and succeeding in competitive quant interviews.

What it tests

This problem class is governed by the principle of adaptive conditional probability: each guess should be made using all available information about the remaining possibilities, updating after every observation. The key is that, as items are removed from a finite set without replacement, the composition of the remaining set becomes increasingly constrained, and the optimal prediction at each step is the one that maximizes the conditional probability of success given the current state. This is not simply about maximizing the probability at each step independently, but about dynamically recalculating the optimal choice as the state evolves. The structure is recursive: each action both reveals information and changes the future landscape of probabilities. The pattern holds because, in any sequential prediction problem with finite resources and full feedback, the optimal strategy is always to guess the most likely outcome given the updated state, exploiting every new piece of information to refine the prediction.

Practise this question with written feedback, or hear it in a spoken mock interview.

Get started free