Guide · brain teasers
Quant brain teasers interviewers actually ask
26 problems · 8 min read · updated 2026-09-07
Brain teasers survive in quant interviews for one reason: they expose how you think when there is no formula to reach for. Jane Street, Optiver, SIG and Citadel do not care whether you have seen the poisoned-wine puzzle before — they care whether you find the invariant, whether you reason from the boundary cases, and whether you can explain a plan before you execute it.
This guide groups the puzzles that keep appearing by the technique that cracks them. Read a section, notice the move that solves every problem in it, and you will recognise the next unseen variant in the room. Every puzzle links to its full worked solution and a spaced-repetition review queue.
Deduction and information
These are information-budget problems. Count how many outcomes the tool you are given can distinguish (a balance scale has three: left, right, level), compare that with how many hypotheses you must separate, and the number of steps falls out before you touch a single weighing.
12 identical-looking balls include exactly one of a different weight — you don’t know if it’s heavier or lighter. Using only a balance scale, what is the minimum number of weighings that guarantees finding the odd ball AND whether it is heavy or light?
Answer: 3 · Worked solution →
You have 1000 bottles of wine, exactly one of which is poisoned. A test strip reacts (after one hour) if it touches any poison. With only one hour before a feast, what is the minimum number of test strips needed to guarantee finding the poisoned bottle?
Answer: 10 · Worked solution →
Three jars are labeled “Apples”, “Oranges”, and “Apples + Oranges”. Every label is wrong. Drawing one fruit at a time without looking, what is the minimum number of draws to correctly relabel all three jars?
Answer: 1 · Worked solution →
Three off switches outside a windowless room each might control the single bulb inside. You may flip switches freely but can enter the room only once. How do you determine which switch controls the bulb?
On an island live 100 blue-eyed people and some brown-eyed people. Nobody knows their own eye colour, everyone sees everyone else’s, and anyone who deduces their own colour must leave that midnight. All islanders are perfect logicians and this is common knowledge. One day a visitor announces to everyone: “At least one of you has blue eyes.” On which night do the blue-eyed islanders leave?
Answer: 100 · Worked solution →
Optimisation and worst cases
Minimise the worst case, not the average. The instinct is binary search; the correct move is usually a schedule whose steps shrink as your remaining budget shrinks. The two-eggs problem is the archetype — once you see why the gaps shorten by one each drop, the camel and the horses follow.
You have 2 identical eggs and a 100-floor building. An egg breaks if dropped from floor F or above. Minimise the number of drops in the worst case needed to find F with certainty. How many drops?
Answer: 14 · Worked solution →
25 horses, a track that races 5 at a time, and no stopwatch. What is the minimum number of races needed to find the 3 fastest horses?
Answer: 7 · Worked solution →
Four people must cross a bridge at night with one flashlight. They take 1, 2, 5 and 10 minutes to cross. At most two cross at once, and a pair moves at the slower person’s pace; the flashlight must be walked back each time. What is the minimum total time (minutes)?
Answer: 17 · Worked solution →
A camel must transport 3,000 bananas across a 1,000 km desert to market. It can carry at most 1,000 bananas at a time and eats 1 banana per km travelled (in either direction). Bananas may be cached anywhere along the route. What is the maximum whole number of bananas that reach the market?
Answer: 533 · Worked solution →
Five rational pirates split 100 gold coins. The most senior proposes a split; if at least half (including the proposer) approve, it passes — otherwise he is thrown overboard and the next-senior proposes. Pirates prioritise survival, then gold, then bloodthirst. How many coins does the most senior pirate keep?
Answer: 98 · Worked solution →
Invariants and parity
When a puzzle asks whether something is possible, the answer is usually an invariant: a quantity every legal move leaves unchanged. Colour the chessboard, count the ants, notice which locker numbers have an odd number of divisors. Interviewers love these because a candidate who finds the invariant explains the whole problem in one sentence.
100 lockers start closed. Person i (for i = 1…100) toggles every locker that is a multiple of i. After all 100 people pass, how many lockers are open?
Answer: 10 · Worked solution →
Two diagonally opposite corner squares are removed from a standard 8×8 chessboard, leaving 62 squares. Can the remaining board be exactly tiled by 31 dominoes, each covering two adjacent squares? Answer yes or no.
Three ants sit on the three corners of a triangle. Each independently picks one of the two edges and starts walking. What is the probability that none collide?
Answer: 1/4 · Worked solution →
At a party of 10 people, everyone shakes hands with everyone else exactly once. How many handshakes happen in total?
Answer: 45 · Worked solution →
You have a 3-gallon jug and a 5-gallon jug and a tap. How do you measure exactly 4 gallons?
Mental math under pressure
Trading desks screen for arithmetic you can do while someone is talking to you. None of these need paper; all of them reward knowing one trick (pair the ends, count factors of 5, track the last digit cyclically) and stating it out loud.
What is the sum of the integers from 1 to 100?
Answer: 5050 · Worked solution →
How many trailing zeros does 100! (100 factorial) have?
Answer: 24 · Worked solution →
What is the last (units) digit of 2^100?
Answer: 6 · Worked solution →
What is the angle (in degrees) between the hour and minute hands of an analog clock at exactly 3:15?
Answer: 7.5 · Worked solution →
You have two ropes; each takes exactly 60 minutes to burn end-to-end, but neither burns at a uniform rate. With only a lighter, how do you measure exactly 45 minutes?
How to approach these in the interview
Say the plan before the answer. Interviewers grade the route. "I have three outcomes per weighing and twenty-four hypotheses, so three weighings should do it" earns more than a correct answer produced in silence.
Solve the small case first. One blue-eyed islander, two eggs with ten floors, three pirates. The pattern in the small case is the proof in the large one, and it buys you thinking time without dead air.
Name the technique. Invariant, information budget, backward induction, minimax. Naming it tells the interviewer you have a toolbox, not a memory of this one puzzle — and it is exactly what protects you when they change the numbers.
When you are stuck, change the question. "What would make this impossible?" and "what if the constraint were removed?" both reveal the structure faster than staring.
Frequently asked
Which firms still ask brain teasers in quant interviews?
Trading firms — Jane Street, Optiver, SIG, IMC, Citadel Securities, Five Rings — use them heavily in first rounds, usually mixed with probability and mental math. Research-heavy shops (Two Sigma, D. E. Shaw) ask fewer pure puzzles and more probability and statistics, but the deduction and invariant puzzles still appear.
How many brain teasers should I practise before a quant interview?
Fewer than you think, more deliberately than you think. Thirty well-understood puzzles grouped by technique beat three hundred memorised answers, because interviewers change the numbers. Aim to be able to explain the method behind each of the puzzles on this page without looking.
What is the hardest brain teaser commonly asked?
By failure rate, the blue-eyed islanders (common knowledge) and screwy pirates (backward induction across five agents) trip up the most candidates. The 100 prisoners problem is the hardest to solve cold, but it is usually asked as a discussion rather than a timed puzzle.
Are the answers to these puzzles public?
Yes — every puzzle on this page shows its final answer, and the full worked solution, answer checking and spaced-repetition review are free with a Google or GitHub sign-in on LeetQuant.
Is the Green Book still the right preparation?
The classic problems in "A Practical Guide to Quantitative Finance Interviews" remain the canon, but the interviews have shifted toward market-making games and faster probability. Use the canon for technique, then practise the modern variants under time pressure.
Practise these with answer checking and spaced review
All 188 problems, full worked solutions, and a review queue that brings each one back before you forget it. Free.
Get started freeRelated guides