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.
Work through 25 original quant brainteasers with answers and reasoning: invariants, strategy games, information bounds, counting and estimation.
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.
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.
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.
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.
Try each question before reading its answer. These original teaching examples remain free to read on this page.
Start with a conserved quantity or a pigeonhole argument. These give short proofs rather than long searches.
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.
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.
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.
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.
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.
Backward induction identifies safe states; decision trees bound how many hidden states a sequence of observations can distinguish.
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.
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.
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.
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.
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.
Check implications and counterexamples carefully. Reversing an implication is a common source of confident but invalid conclusions.
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.
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.
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.
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.
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.
Specify what counts as a distinct outcome, then use symmetry, dimensions or combinations.
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.
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).
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.
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.
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.
Expose assumptions and units. Some questions test whether you can identify missing information before calculating.
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.
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.
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.
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.
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.
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.
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.
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 | Bank entries |
|---|---|
| Logic | 163 |
| Games & Strategy | 49 |
| Arithmetic & Number Puzzles | 42 |
| Geometry Puzzles | 34 |
| Combinatorics | 26 |
| Weighing & Measuring | 23 |
| Algebra & Number Theory | 4 |
| Events | 3 |
| Physics Puzzles | 3 |
| Calculus | 2 |
| Estimation/Fermi | 2 |
| Discrete Random Variables | 1 |
| Options Pricing | 1 |
| Linear Algebra | 1 |
| Expected Value | 1 |
Bank difficulty labels: 192 easy · 112 medium · 51 hard.
Use these lesson previews to find the definitions and derivations behind the worked examples.
Continue with 355 brainteaser/logic questions in the practice bank.
Open the brainteaser/logic bank