Brain Teaser Interview Questions

Brain teaser questions in quant interviews come in five recurring flavors: logic & information puzzles, invariant & parity arguments, rate-and-motion traps, number & calendar arithmetic, and quick limits & estimation.
The common thread: the unlocking idea is simpler than the problem looks — interviewers are testing whether you find structure before you start computing.

Last updated 2 July 2026 · sub-areas, difficulty mix and firm attributions on this page are compiled directly from the 80 brain-teaser problems in the QuantVault bank; firm tags are candidate-reported, not employer-verified, and no individual author is named in our source data.

Core sub-areas
Logic & information · invariants & parity · rates & motion · number & calendar arithmetic · limits & estimation
Typical difficulty
Skews easy-to-medium — 47 easy, 27 medium and 6 hard across the 80-problem set
Who leans on it
Early trading-track rounds — problems here carry candidate tags from Jane Street, WorldQuant, SIG, Virtu, Citadel, Five Rings and others
Practice pool
80 problems in the bank · 19 free to open with the full worked solution

Where brain teasers show up: mostly in first-round phone screens and trader interviews, where a two-minute puzzle doubles as a composure test — and occasionally as the warm-up before harder probability. For how they sit inside specific funnels, see the Jane Street interview questions guide and the WorldQuant interview questions guide.

Practice brain teaser questions interactively → Browse the full problem bank All interview topics

The surfaceThe brain teaser sub-areas quant interviews test

Five families cover essentially every brain teaser in the bank. Each row pairs a sub-area with the recurring question shape and a representative type — a flavor drawn from real problems, not a leaked wording — so you can see where the trick actually hides.

The brain teaser sub-areas tested in quant interviews, with the recurring question shape and a representative question type for each.
Sub-areaRecurring shapeRepresentative type (flavor, not a real question)
Logic & information puzzlesCount the outcomes each test or question can distinguish, then design the procedureA weighing, tasting or yes/no-question setup where the answer is forced by an information bound — mislabeled containers, a counterfeit coin, a truth-teller you get one question to expose.
Invariants, parity & symmetryFind a quantity every legal move preserves, then compare start to finishA repeated-reduction or blindfolded-splitting game whose outcome is settled by a parity or count that never changes, no matter how you play.
Rates, motion & everyday algebraRebuild the quantity from totals — total distance over total time, not the average of averagesA two-lap average-speed trap, an exponential-doubling head start, or a resource-rotation puzzle where the naive arithmetic mean is exactly the wrong answer.
Number & calendar arithmeticTranslate the riddle into a congruence or a tiny search space, then check the handful of casesA day-of-the-week for a far-future date, an age whose square is the year, a digit condition that only one two-digit number satisfies.
Limits & estimationOne-line asymptotic or a Fermi decomposition into factors you can defendA famous-ratio limit, a which-is-bigger comparison of transcendental expressions, or an order-of-magnitude capacity estimate built from stated assumptions.

What's confirmed vs. what varies: the sub-areas and the difficulty mix above come straight from the problem set, so they are stable. Which firm asks which flavor is candidate-reported through problem tags — treat the attributions as directional; fast-paced trading screens lean on the rate and estimation families.

The patternsSignature brain teaser question patterns

Three moves generate most correct answers in this topic. Each worked box below is a 60–90 second micro-example in the interview's actual cadence — the reasoning template, applied to a generic setup rather than any firm's wording.

Information counting — bound first, construct second

Takeaway: before designing any weighing or testing scheme, count outcomes — \(t\) tests with \(k\) outcomes each can distinguish at most \(k^t\) states, and that bound tells you the answer.

Shape. Nine visually identical coins, one heavier. Using a balance scale, what is the minimum number of weighings to find it?

1. Bound. Each weighing has three outcomes: left heavy, right heavy, balance. So \(t\) weighings distinguish at most \(3^t\) coins; you need \(3^t \ge 9\), hence \(t \ge 2\).

2. Construct. Weigh 3 vs 3. If one side drops, the heavy coin is in that triple; if balanced, it is in the third. Repeat 1 vs 1 inside the guilty triple.

3. Say the bound out loud. The construction matches the information bound, so two weighings is optimal — not just sufficient. The move: log-count the states, then build a scheme that uses every outcome.

The harmonic-mean trap — averages of rates are not rates

Takeaway: average speed is total distance over total time — recompute from totals, and you will catch the trap that the arithmetic mean of two speeds sets.

Shape. You drive a lap at 30 km/h. How fast must the second, equal-length lap be for the two-lap average to reach 60 km/h?

1. Set the budget. Let each lap be \(d\). Averaging 60 over \(2d\) allows total time \(2d/60 = d/30\).

2. Check what's spent. The first lap alone took \(d/30\) — the entire time budget is already gone.

3. Conclude. The second lap would need to take zero time: impossible at any finite speed. The move: never average speeds directly — convert to times, add, then divide distance by time.

Invariants — find what the moves cannot change

Takeaway: when a process looks chaotic, hunt for a conserved quantity — a parity, a sum mod \(k\), a count — because it settles the endgame without simulating a single move.

Shape. The numbers 1 through 100 are on a board. Repeatedly erase any two, \(a\) and \(b\), and write \(|a-b|\). What can the last remaining number be — odd or even?

1. Test the sum. Each move changes the total by \(a + b - |a-b| = 2\min(a,b)\), an even amount — so the parity of the sum never changes.

2. Evaluate it once. The starting sum is \(1+2+\dots+100 = 5050\), which is even.

3. Read off the answer. The final number has the parity of the invariant: even, no matter how the moves are played. The move: ask “what is preserved?” before asking “what happens?”

Free practiceBrain teaser practice questions by sub-area

All 19 free problems from the 80-problem brain-teaser set, grouped by the sub-areas above — every link opens the full worked solution, so you can check your reasoning line by line. One honesty note: the free pool is 13 easy and 6 medium; the bank's 6 hard brain teasers sit in the paid tier, so treat a clean, fast medium here as your benchmark.

Logic & information puzzles

Invariants, parity & symmetry

Rates, motion & everyday algebra

Number & calendar arithmetic

Limits & estimation

The planHow to prepare for brain teaser questions

Five techniques to make reflexive, in the order they pay off. Each maps onto one of the practice groups above, so you can drill it immediately after reading.

  1. Count information before designing procedures. For any weighing, testing or questioning puzzle, first compute how many states must be distinguished and how many outcomes each probe yields — the ceiling of the log gives the answer, and the scheme follows.
  2. Hunt for invariants. When a process mutates a set or a board, ask what every move preserves — a parity, a sum mod \(k\), a count. Practice stating the invariant in one sentence before touching any cases.
  3. Distrust averaged rates. Rebuild every speed, work-rate or mileage question from totals: total distance over total time, total work over total workers. The trap in these puzzles is almost always an illegitimate arithmetic mean.
  4. Make small modular arithmetic fast. Calendar puzzles are 365 mod 7 plus leap-day care; digit puzzles are a search over a space small enough to enumerate. Speed here is pure practice, and it frees attention for the genuinely novel questions.
  5. Keep a limits-and-Fermi toolkit warm. Know the handful of classic ratios and inequalities cold, and decompose any estimation ask into three or four defensible factors. Then run the free practice set and take the interactive brain teaser playlist on a clock.

FAQBrain teaser interview questions — frequently asked

How important are brain teasers for quant interviews?

A screening staple, especially in first-round phone screens and trader interviews: they are quick to ask, hard to fake, and test whether you find structure before you start computing. They rarely decide an onsite by themselves, but a fumbled teaser early can end one.

What brain teaser topics should I focus on?

Logic-and-information puzzles and invariant/parity arguments give the highest return, because one template each covers many variants. Round those out with harmonic-mean rate traps, fast modular arithmetic for calendar and digit puzzles, and a small limits-and-estimation toolkit.

How hard are brain teaser interview questions?

Mostly easy-to-medium: of the 80 problems in this set, 47 are easy, 27 are medium and 6 are hard. The challenge is finding the unlocking idea quickly under interview pressure — once you see it, the remaining work is usually a few lines.

Are these real quant interview questions?

They are representative, not verbatim. The problems are curated from our bank to match the brain-teaser shapes candidates report, rewritten for clarity with worked solutions we author ourselves — we never claim any wording is a leaked question.