Fastest 3 Horses in 7 Races

This classic quant brain teaser is about ranking and selection under constraints: you must identify the very best elements in a larger set when you cannot compare everything at once. Instead of full information, you only observe partial orderings from small groups and must exploit the transitivity of those orderings to deduce the global ranking. It is a clean abstraction of many quant finance problems where full data is unavailable or expensive.

It trains structured thinking about elimination, combinatorial optimization, and information efficiency. Strong candidates use it in their quant prep to practice designing experiments that squeeze the maximum information out of each step, while carefully tracking what is known, what is impossible, and what remains uncertain.

This matters for quant interviews because trading, research, and risk roles constantly involve making optimal decisions under constraints: limited capital, limited data, limited time. Interviewers use this question to see how you plan, justify assumptions, and manage a multi-step reasoning process. On MyQuantPartner, brain teasers like this sharpen your ability to turn vague, constrained problems into clear, logically tight solutions, a core skill in top quant interviews.

What it tests

When you have a set of objects with unknown relative rankings and can only compare a subset at a time, the key is to structure comparisons so that each race maximally narrows down the set of possible top candidates. The principle is to use elimination: after each round, use the information from relative placements to rule out as many objects as possible from contention for the top spots. This is possible because the transitivity of rankings (if A beats B and B beats C, then A is faster than C) allows you to infer relationships without direct comparison. The minimum number of rounds is determined by how efficiently you can eliminate non-contenders while ensuring that no possible top candidate is missed, given the constraints on group size and available information (no timing, only order). The structure of the problem is governed by combinatorial optimization: you want to minimize the number of rounds while guaranteeing certainty about the top ranks.