Skip to content
Interview prep / Brainteaser/Logic

25 quant brainteasers and logic questions with answers

Work through 25 original quant brainteasers with answers and reasoning: invariants, strategy games, information bounds, counting and estimation.

How to approach these questions

A brainteaser becomes manageable when you identify what cannot change or how much information each action reveals. These examples build from simple impossibility arguments to strategic games, logical implications and estimates. Say the reasoning aloud: an interviewer should be able to follow why the answer is forced, rather than being asked to trust a remembered trick.

Look for an invariant

Totals, parity, colour counts and ordering can rule out a target before you search for a construction. Check that every permitted move really preserves the proposed invariant.

Work backward from the end

For a game, classify terminal positions first and propagate winning and losing states backward. A change from last-move-wins to last-move-loses changes the boundary conditions.

Separate guarantees from probabilities

A worst-case guarantee needs to cover every allowed configuration. An average-case estimate needs a probability model; the two questions can have different answers.

Sample questions, answers and explanations

Try each question before reading its answer. These original teaching examples remain free to read on this page.

Invariants and guarantees

Start with a conserved quantity or a pigeonhole argument. These give short proofs rather than long searches.

1. Same remainder

Among 8 integers, must two have the same remainder after division by 7?

Answer: Yes.

Explanation: Seven remainder classes hold eight integers. The pigeonhole principle guarantees a collision without specifying which pair.

2. Guarantee a matching pair

A drawer holds many black and white socks. How many blind draws guarantee two of one colour?

Answer: 3.

Explanation: The worst first two draws have different colours. A third must match one of them; a probability calculation is unnecessary.

3. Domino tiling obstruction

Remove two opposite corners from an 8 × 8 chessboard. Can 31 dominoes tile the remainder?

Answer: No.

Explanation: Opposite corners share a colour. Each domino covers one square of each colour, so the remaining colour imbalance makes tiling impossible.

4. Odd number of toggles

A switch starts off and is toggled 101 times. What is its final state?

Answer: On.

Explanation: Only parity matters. Pairing toggles cancels their effects and leaves one toggle.

5. An invariant under transfers

Two accounts contain 7 and 11 tokens. A move transfers one token between accounts. Can both eventually contain 10?

Answer: No.

Explanation: Every move preserves the total 18, while the proposed target totals 20. Check invariants before exploring move sequences.

Games and information

Backward induction identifies safe states; decision trees bound how many hidden states a sequence of observations can distinguish.

6. A one-pile take-away game

Two players alternately remove 1, 2 or 3 counters. Taking the last wins. With 14 counters, what is a winning first move?

Answer: Remove 2, leaving 12.

Explanation: Multiples of 4 are losing positions. Thereafter remove enough that each pair of turns takes four counters.

7. Change the terminal rule

Players remove 1 or 2 counters, but taking the last loses. With 5 counters, what first move wins?

Answer: Remove 1.

Explanation: Losing positions are 1, 4, 7, … . Leave 4 and then respond to keep the opponent facing a losing position.

8. Identify a number by yes/no questions

A hidden integer lies from 1 to 100. What is the minimum worst-case number of unrestricted yes/no questions?

Answer: 7.

Explanation: Six answers distinguish at most 64 cases; seven distinguish 128. Balanced range questions achieve the bound.

9. One heavy token

Exactly one of 9 otherwise identical tokens is heavier. How many balance-scale weighings suffice to identify it?

Answer: 2.

Explanation: Weigh three against three. The result selects a group of three, then one against one identifies the heavy token.

10. Lower bound on weighings

A balance scale gives three outcomes per weighing. Can two adaptive weighings distinguish 10 possible hidden states?

Answer: No.

Explanation: A depth-two ternary decision tree has at most nine leaves. An information bound rules out every strategy.

Logical reasoning

Check implications and counterexamples carefully. Reversing an implication is a common source of confident but invalid conclusions.

11. One truth-teller and one liar

Two guards know which of two doors is safe. One always lies and one always tells the truth. What single question to either identifies the safe door?

Answer: Ask which door the other guard would call safe, then choose the opposite.

Explanation: Both layers invert the truth exactly once. The argument assumes each guard knows the other's response and a safe door exists.

12. Test a universal claim

Someone says every positive integer is the sum of two odd positive integers. Give a counterexample.

Answer: 3.

Explanation: Two odd integers sum to an even number. One counterexample refutes a universal claim; checking many even cases cannot establish it.

13. Read an implication

If every valid order has an identifier, what follows when an order has no identifier?

Answer: The order is invalid.

Explanation: Use the contrapositive. Having an identifier alone does not prove validity; that would reverse the implication.

14. Empty-set reasoning

Is the statement “every failed trade in an empty log has an error code” true?

Answer: Yes, as a universal statement over an empty set.

Explanation: There is no counterexample. This does not establish that the logging system actually captures failures.

15. Check incompatible statements

Can exactly one of “A is true” and “A is false” be true under ordinary two-valued logic?

Answer: Yes; exactly one must be true.

Explanation: A proposition and its negation have complementary truth values. Distinguish logical negation from a separate empirical claim.

Geometry and counting

Specify what counts as a distinct outcome, then use symmetry, dimensions or combinations.

16. Scale a square

Double the side length of a square. By what factor does its area change?

Answer: 4.

Explanation: Area depends on the square of a length. Keep dimensional scaling separate from an additive change in length.

17. Shortest path on a grid

How many shortest north/east paths run from (0,0) to (3,2)?

Answer: 10.

Explanation: Every shortest route contains three east and two north steps. Choose the two north positions among five: C(5,2).

18. Handshakes

Six people each shake hands with every other person once. How many handshakes occur?

Answer: 15.

Explanation: Count unordered pairs, C(6,2). Counting six partners for six people incorrectly includes self-pairs and double counting.

19. Straight cuts through a pancake

What is the largest number of planar pieces from three straight cuts of a flat circular pancake, without stacking?

Answer: 7.

Explanation: Each new cut can add one more piece than the previous cut if all intersections are distinct and inside the circle.

20. Relative speed

Two walkers start 120 metres apart and approach each other at 2 and 3 metres per second. When do they meet?

Answer: After 24 seconds.

Explanation: Separation closes at the sum of speeds, 5 metres per second. A dimensional check confirms distance divided by speed.

Estimation and communication

Expose assumptions and units. Some questions test whether you can identify missing information before calculating.

21. Estimate a queue

A service handles 600 requests per hour and each request spends 2 minutes in the system on average. Estimate average requests in the system.

Answer: 20, under stable steady-state conditions.

Explanation: Little's law gives arrival rate times mean time: 10 per minute × 2 minutes. State the stability assumption.

22. Doubling inventory

A colony doubles daily and fills a container on day 20. On what day was it half full?

Answer: Day 19.

Explanation: Work backward by one doubling. Day 10 would confuse linear elapsed time with exponential growth.

23. A price difference puzzle

Two items cost 14 units in total. The expensive one costs 10 more than the cheap one. Find the cheap item's price.

Answer: 2 units.

Explanation: Set the cheap price to x and solve x + (x + 10) = 14. Subtracting 10 gives twice the cheap price.

24. Guarantee a shared month

How many people guarantee at least two share a birth month?

Answer: 13.

Explanation: There are twelve month categories. This is a deterministic guarantee, unlike the birthday probability problem.

25. An underspecified puzzle

A question asks for the “best” strategy but gives no payoff or stopping rule. What should you do first?

Answer: Ask for the objective, legal moves and terminal conditions.

Explanation: A strategy cannot be optimal without an objective. Clarifying assumptions is part of solving the problem, not an evasion.

328 brainteaser/logic questions from the bank

Each question has its own page with a short answer and a credit to its source. Hints and full worked solutions are in the question bank with a free account.

  1. Five pirates splitting a hundred gold coinsMedium
  2. Monotone lattice paths across a six-by-six boardEasy
  3. Re-flipping only the heads until a uniform resultMedium
  4. Opening move in a race to fiftyMedium
  5. Repunit-style numbers whose product equals their sumMedium
  6. Time to fire three shots from a six-shooterEasy
  7. Ten tasters finding one poisoned wine barrelMedium
  8. Bacteria count after forty more minutesEasy
  9. Group size forcing a shared birth monthEasy
  10. Is 1027 primeEasy
  11. Wine fraction after mixing two diluted glassesEasy
  12. Triangles from prime-difference chords on a circleHard
  13. Ages that are sums of powers in a 19th-century lifeMedium
  14. Photo line with heights falling away from the middleMedium
  15. One six in four rolls versus double six in 24Medium
  16. Finding one heavy bean among eightEasy
  17. Three uniforms falling in a set orderEasy
  18. Regular polygons with whole-degree interior anglesEasy
  19. Length of a river from drifting and swimming timesEasy
  20. Dollars and cents swap after spending halfMedium
  21. Integers up to ten thousand containing a zeroEasy
  22. Weighing a fish from its head, body and tailEasy
  23. Perfect shuffles needed to restore a deckHard
  24. Total of all digits from one to a millionMedium
  25. Size of a partial deck from three remaindersEasy
  26. Share of dogs in an endless line of petsMedium
  27. Power-of-two ball game where taking the last losesHard
  28. Two mowers sharing one lawnEasy
  29. Who sits left of person five at a round tableEasy
  30. Grabbing socks blindly until two matchEasy
  31. Shipping oil a thousand miles with leaky relaysMedium
  32. Adults at a concert before a bus arrivesMedium
  33. Price alternately falling and rising one percentEasy
  34. Four walkers and one lantern on a narrow bridgeEasy
  35. Finishing position from distances to last and halfwayEasy
  36. Number whose first six multiples permute its digitsMedium
  37. Next time the clock hands coincide after noonEasy
  38. Ants released from both ends of a stringEasy
  39. Pascal row with neighbouring entries in ratio 3 to 4 to 5Medium
  40. Which of four switches lights the bulbEasy
  41. Picking the safest full house before a random dealMedium
  42. Two hoses against an open drainEasy
  43. Most sides a cube's shadow can haveMedium
  44. Days for ten growing lily pads to cover a pondMedium
  45. Next calendar date with eight different digitsMedium
  46. How many plums balance one pearMedium
  47. Five-digit numbers starting 37 with rotations divisible by 37Hard
  48. Most likely final die face when passing 1000Easy
  49. One percent daily growth for one hundred daysEasy
  50. Identical bikes and a total spoke countMedium

What our question-bank data shows

Our bank summary dated contains 355 Brainteaser/Logic entries in the bank. Counts describe entries in our curated practice bank, including its source and classification choices. They do not measure employer interview frequency, candidate success rates or how often any one question is asked.

  • Logic: 163 entries, or 45.9% of this topic's bank. Use this coverage to identify areas for practice alongside the technique-based examples above.
  • Games & Strategy: 49 entries, or 13.8% of this topic's bank. Use this coverage to identify areas for practice alongside the technique-based examples above.
  • Arithmetic & Number Puzzles: 42 entries, or 11.8% of this topic's bank. Use this coverage to identify areas for practice alongside the technique-based examples above.

The public examples above were written for these guides. They illustrate the techniques and are not a reproduction or ranking of the bank's sourced questions. The dashboard's broader bank combines sourced questions, worked answers where available and references for book entries without a reproduced solution.

Subtopic coverage in the bank

SubtopicBank entries
Logic163
Games & Strategy49
Arithmetic & Number Puzzles42
Geometry Puzzles34
Combinatorics26
Weighing & Measuring23
Algebra & Number Theory4
Events3
Physics Puzzles3
Calculus2
Estimation/Fermi2
Discrete Random Variables1
Options Pricing1
Linear Algebra1
Expected Value1

Bank difficulty labels: 192 easy · 112 medium · 51 hard.

Lessons behind the techniques

Use these lesson previews to find the definitions and derivations behind the worked examples.

Practise with free tools

Continue with 355 brainteaser/logic questions in the practice bank.

Open the brainteaser/logic bank

Other interview topic guides