Category 1: Logic & Deduction

1

Three Bulbs and Three Switches

The Problem

You are outside a closed room with three light switches. Inside the room are three light bulbs, each controlled by one of the switches. You can flip the switches as many times as you want while outside, but once you open the door and enter the room, you cannot touch the switches again. How do you determine which switch controls which bulb with only one entry into the room?

Your First Instinct

"I'll turn on two switches and enter - but this only identifies 2 out of 3 bulbs."

The Key Insight

Use multiple properties of bulbs: light (on/off) AND heat (hot/cold).

Solution Steps

• 1.Turn on Switch 1 and leave it on for 5 minutes.
• 2.After 5 minutes, turn off Switch 1 and immediately turn on Switch 2.
• 3.Enter the room immediately.

Result Analysis

Bulb that's ON = controlled by Switch 2. Bulb that's OFF but HOT = controlled by Switch 1. Bulb that's OFF and COLD = controlled by Switch 3.

Pattern Learned

Multi-dimensional problem solving - use multiple attributes (light + heat).

Interview Script

"First, let me clarify - can I flip switches multiple times? Good. My approach uses both light and heat as indicators. I'll turn on Switch 1 for several minutes to heat the bulb, then switch to Switch 2 before entering. This way, I can distinguish all three: one lit, one hot, one cold."

Common Mistakes

• Trying to identify all bulbs using only on/off states.
• Not realizing bulbs retain heat.

Related Variations

• 4 bulbs and 4 switches (requires different approach).
• Limited time window for entering room.

2

Heaven and Hell Doors

The Problem

You're standing in front of two identical doors. One leads to heaven, the other to hell. Two guards stand by the doors - one always tells the truth, and one always lies. You don't know which guard is which, and you don't know which door leads where. You can ask only ONE question to ONE guard to find the door to heaven. What question do you ask?

Your First Instinct

"'Which door is heaven?' - Won't work because you don't know if the guard lies."

The Key Insight

Create a self-referential question that cancels out the lie.

Solution Steps

• 1.Pick either guard.
• 2.Ask: 'If I asked the OTHER guard which door leads to heaven, what would they say?'
• 3.Choose the OPPOSITE door of what they point to.

Logic Breakdown

If you ask the TRUTH-TELLER: He'll tell you the liar would point to HELL (because liar lies). If you ask the LIAR: He'll lie about what truth-teller would say, and point to HELL. Both guards point to the SAME door (hell).

Pattern Learned

Logical paradoxes and double-negative thinking.

Interview Script

"I need to design a question where both guards give the same answer. If I ask about what the OTHER guard would say, the truth-teller reports the liar's false answer, and the liar lies about the truth-teller's answer. Both point to hell, so I choose the opposite door."

Common Mistakes

• Asking direct questions about the doors.
• Trying to identify which guard is which first.

Related Variations

• Three doors with one guard.
• Multiple guards with different truth-telling patterns.

3

Monty Hall Problem

The Problem

You're on a game show with three doors. Behind one door is a car (prize), behind the other two are goats. You pick Door 1. The host, who knows what's behind each door, opens Door 3 to reveal a goat. He then asks if you want to switch to Door 2 or stick with Door 1. Should you switch, stay, or does it not matter?

Your First Instinct

"It doesn't matter. There are two doors left, so it's a 50/50 chance."

The Key Insight

The host's action is not random; he provides information by filtering out a wrong choice.

Solution Steps

• 1.Pick a door (1/3 chance of being right).
• 2.Host opens a 'goat' door from the remaining two.
• 3.Switch to the other closed door.

Logic Breakdown

When you first pick, there's a 1/3 chance you're right and a 2/3 chance the car is behind one of the other two doors. The host MUST open a goat door from the other two. By doing so, he 'concentrates' that 2/3 probability into the single remaining unopened door. Staying = 1/3 win rate. Switching = 2/3 win rate.

Pattern Learned

Conditional probability and Bayesian thinking.

Interview Script

"While it feels like 50/50, the host's knowledge changes the odds. Initially, I have a 1/3 chance. The 2/3 chance that I was wrong is now entirely focused on the door the host didn't open. Therefore, switching doubles my chances."

Common Mistakes

• Assuming the new state (2 doors) resets the probability to 50/50.
• Ignoring that the host *knows* where the car is.

Related Variations

• 100 doors version (Host opens 98 goat doors).
• Host doesn't know where the car is (Monty Fall).

4

100 Prisoners and Hats

The Problem

100 prisoners are standing in a line, all facing forward. Each has a red or black hat. Each can see all hats in front but not their own or those behind. Starting from the back, each must say 'red' or 'black'. If they guess correctly, they survive. They can discuss a strategy beforehand. What strategy maximizes survivors?

Your First Instinct

"Everyone guesses based on the hat in front of them (saves 50% on average)."

The Key Insight

The first person can sacrifice their guess to provide a 'parity' bit for everyone else.

Solution Steps

• 1.The last person (who sees 99 hats) counts the number of RED hats.
• 2.If even, they say 'RED'. If odd, they say 'BLACK'.
• 3.The next person uses this parity and the hats they see to deduce their own color.

Logic Breakdown

The first person has a 50% chance of survival. However, their answer tells the 99th person whether the total number of red hats is even or odd. The 99th person looks at the 98 hats in front. If the parity changed, their own hat must be the reason. They state their color and survive. This continues down the line, with each person tracking the parity of colors already called.

Pattern Learned

Information theory and Parity bits.

Interview Script

"The prisoners can guarantee 99 survivors. The first person acts as a checksum. By saying 'red' for an even count of red hats in front, the next person can compare that to what they see and determine their own color with 100% certainty."

Common Mistakes

• Thinking each guess is independent.
• Not accounting for the information revealed by previous answers.

Related Variations

• 3 or more hat colors (requires modulo arithmetic).
• Prisoners can't hear previous answers (much harder).

5

Man in Elevator

The Problem

A man lives on the 10th floor. Every morning, he takes the elevator to the ground floor. In the evening, he takes it to the 7th floor and walks up to the 10th. On rainy days or when others are in the elevator, he goes directly to the 10th. Why?

Your First Instinct

"He wants the exercise, but only when it's not raining."

The Key Insight

The man has a physical limitation that prevents him from reaching the '10' button.

Solution Steps

• 1.Identify the constraint: Why can he go down but not up?
• 2.Identify the exceptions: Why does rain or other people help?
• 3.Deduce the man's height.

Logic Breakdown

The man is a dwarf (or a very short person). He can reach the 'G' button because it's at the bottom, but he can't reach the '10' button. On rainy days, he uses his umbrella to poke the button. When others are there, he asks them to press it for him.

Pattern Learned

Lateral thinking - questioning implicit assumptions (that the man is average height).

Interview Script

"This is a classic lateral thinking puzzle. The key is the 'rainy day' clue. An umbrella is a tool that extends reach. This implies the man physically cannot reach the button for the 10th floor, likely because he is a person of short stature."

Common Mistakes

• Over-complicating with psychological reasons.
• Ignoring the 'rainy day' and 'other people' conditions.

Related Variations

• The man who hung himself in a room with only a puddle of water.
• The man who died because he went home and saw the light was off.

Category 2: Optimization Problems

6

Bridge and Torch

The Problem

Four people (A, B, C, D) need to cross a bridge at night. They have one torch. Max 2 people at a time. A takes 1 min, B takes 2, C takes 5, D takes 10. When two cross, they move at the slower person's pace. How can all cross in 17 minutes?

Your First Instinct

"Send the fastest person (A) back and forth to escort everyone. (1+2 + 1+5 + 1+10 = 19 mins - too slow!)"

The Key Insight

The two slowest people (C & D) should cross together to 'bundle' their time loss.

Solution Steps

• 1.A and B cross (2 mins).
• 2.A returns with the torch (1 min).
• 3.C and D cross (10 mins).
• 4.B returns with the torch (2 mins).
• 5.A and B cross again (2 mins).

Logic Breakdown

Total time: 2 + 1 + 10 + 2 + 2 = 17 minutes. The key is realizing that if C and D cross separately, they waste 15 minutes. By crossing together, they only count the 10-minute penalty once. We just need to ensure someone is on the other side to bring the torch back.

Pattern Learned

Resource optimization and 'bottleneck bundling'.

Interview Script

"The intuitive approach of using the fastest person as a shuttle fails because it exposes the slow speeds of C and D twice. By sending C and D together, we only count the 10-minute penalty once. We just need to ensure someone is on the other side to bring the torch back."

Common Mistakes

• Sending the slowest people separately.
• Forgetting that someone must bring the torch back.

Related Variations

• Different time values.
• 3 people at a time (changes the strategy significantly).

7

Two Eggs and 100 Floors

The Problem

You have two identical eggs and a 100-story building. Find the highest floor an egg can be dropped from without breaking. If an egg breaks, it's gone. What's the minimum number of drops needed in the worst case?

Your First Instinct

"Drop the first egg every 10 floors (10, 20, 30...). If it breaks at 20, test 11-19 with the second egg. (Max 19 drops)."

The Key Insight

To minimize the worst case, the total number of drops (Egg 1 + Egg 2) should stay constant as you go higher.

Solution Steps

• 1.Let 'x' be the number of drops.
• 2.If the first egg breaks, the second egg will have x-1 more drops to make.
• 3.The next jump for the first egg should be x-1 floors, then x-2, and so on.
• 4.Solve: x + (x-1) + (x-2) + ... + 1 >= 100.

Logic Breakdown

The formula for the sum of first x integers is x(x+1)/2. x(x+1)/2 >= 100 leads to x = 14. Strategy: Drop at floor 14, 27 (14+13), 39 (27+12), 50, 60, 69, 77, 84, 90, 95, 99, 100.

Pattern Learned

Load balancing and triangular numbers.

Interview Script

"We want to balance the risk. If the first egg lasts longer, we have fewer drops left for the second egg. This leads to a decreasing step size. Solving the quadratic equation gives us 14 drops as the optimal worst-case scenario."

Common Mistakes

• Suggesting Binary Search (doesn't work with only 2 eggs).
• Using a constant step size (like 10).

Related Variations

• 3 eggs and 100 floors.
• N eggs and K floors (Dynamic Programming).

8

25 Horses and 5 Tracks

The Problem

You have 25 horses and a 5-lane track. No timer. Find the top 3 fastest horses. What is the minimum number of races?

Your First Instinct

"Race 5 groups, then race the winners (6 races). But this only finds the #1 horse."

The Key Insight

After finding the #1 horse, only a few others have a mathematical chance of being #2 or #3.

Solution Steps

• 1.Race 5 groups of 5 (5 races). Let's call winners A1, B1, C1, D1, E1.
• 2.Race the winners (1 race). Assume order is A1 > B1 > C1 > D1 > E1.
• 3.A1 is definitely #1. D1 and E1 (and their groups) are out.
• 4.Final race: A2, A3, B1, B2, C1 (1 race).

Logic Breakdown

Total: 5 + 1 + 1 = 7 races. Why these 5 in the final? A2/A3 could be faster than B1. B2 could be faster than C1. C1 could be #3. Anything else (like B3 or C2) is mathematically impossible to be in the top 3.

Pattern Learned

Elimination logic and tournament sorting.

Interview Script

"First, we find the fastest of each group. Then we race those winners to find the absolute fastest. The trick is identifying which horses could still be 2nd or 3rd. Only 5 horses remain as candidates, requiring one final race."

Common Mistakes

• Thinking 6 races is enough.
• Including too many horses in the final race.

Related Variations

• Find top 2 horses (6 races).
• Find top 5 horses.

9

Five Pirates and 100 Gold Coins

The Problem

Five rational pirates (A > B > C > D > E) must distribute 100 coins. Proposer needs 50% or more votes to survive. Pirates want to maximize coins, then stay alive, then throw others overboard. How should Pirate A distribute?

Your First Instinct

"Give everyone an equal share (20 each) to be safe."

The Key Insight

Work backwards from the simplest case (2 pirates) to see what leverage you have.

Solution Steps

• 1.2 Pirates (D, E): D gives himself 100, E 0. D's vote is 50%.
• 2.3 Pirates (C, D, E): C needs one more vote. He gives E 1 coin (better than 0 from D). C: 99, D: 0, E: 1.
• 3.4 Pirates (B, C, D, E): B needs one more vote. He gives D 1 coin. B: 99, C: 0, D: 1, E: 0.
• 4.5 Pirates (A, B, C, D, E): A needs two more votes. He gives C 1 and E 1.

Logic Breakdown

Final Distribution: A: 98, B: 0, C: 1, D: 0, E: 1. Pirates C and E vote 'Yes' because 1 coin is better than the 0 they would get if B was the proposer.

Pattern Learned

Game Theory and Backward Induction.

Interview Script

"By working backwards, we see that Pirate A only needs to bribe the pirates who would get nothing in the next round. Since B would give C and E nothing, A can buy their votes for just 1 coin each."

Common Mistakes

• Being too generous.
• Not realizing that 50% includes the proposer's own vote.

Related Variations

• 100 pirates and 100 coins.
• Pirates prefer to kill if coins are equal.

10

Gold Bar with 7 Segments

The Problem

You hire a worker for 7 days. You must pay them 1 segment of gold each day. You have a 7-segment bar. What is the minimum number of cuts to make this possible? (You can take back change).

Your First Instinct

"6 cuts to make 7 individual pieces."

The Key Insight

Think in binary. You only need pieces of size 1, 2, and 4 to represent any number from 1 to 7.

Solution Steps

• 1.Make two cuts to get pieces of size 1, 2, and 4.
• 2.Day 1: Give 1.
• 3.Day 2: Give 2, take back 1.
• 4.Day 3: Give 1 (now they have 1+2).
• 5.Day 4: Give 4, take back 1 and 2.

Logic Breakdown

This is exactly how binary counting works. With pieces of 2^0, 2^1, and 2^2, you can form any sum up to 2^3 - 1.

Pattern Learned

Binary representation and change-making.

Interview Script

"I only need 2 cuts. By cutting the bar into segments of 1, 2, and 4, I can pay the worker every day by using the previously paid segments as change, similar to how we use currency."

Common Mistakes

• Forgetting you can take segments back as change.
• Making 3 cuts.

Related Variations

• 15 segments (3 cuts).
• 31 segments (4 cuts).

11

Camel and 3000 Bananas

The Problem

3000 bananas, 1000km to market. Camel carries 1000 max, eats 1 banana per km. What's the max bananas at market?

Your First Instinct

"Camel takes 1000, travels 1000km, eats 1000. Result: 0."

The Key Insight

You must create 'supply depots' along the way to move all bananas forward.

Solution Steps

• 1.Step 1: Move 3000 bananas to a point where you have 2000 left. (5 trips, 3 forward, 2 back).
• 2.Step 2: Move 2000 bananas to a point where you have 1000 left. (3 trips, 2 forward, 1 back).
• 3.Step 3: Move the final 1000 to the market.

Logic Breakdown

Breakpoint 1: 5 trips * distance = 1000 bananas consumed. Distance = 200km. Breakpoint 2: 3 trips * distance = 1000 bananas consumed. Distance = 333.33km. Remaining distance: 1000 - 200 - 333.33 = 466.66km. Final bananas: 1000 - 467 = 533.

Pattern Learned

Dynamic programming and optimization of multi-stage transport.

Interview Script

"The key is to reduce the number of trips as soon as possible. We start with 5 trips to move 3000 bananas. Once we've consumed 1000, we only need 3 trips. Once we're down to 1000, we make one final trip."

Common Mistakes

• Not accounting for the return trips.
• Trying to go the full distance in one go.

Related Variations

• Jeep and Fuel problem (identical logic).
• Different carrying capacities.

12

Chain Link Problem

The Problem

5 pieces of chain, each with 3 links. You want one continuous chain. Opening a link costs $2, closing costs $3. Minimum cost?

Your First Instinct

"Join the 5 pieces using 4 connections. (4 opens + 4 closes = $20)."

The Key Insight

You can sacrifice one entire piece to provide the 'connectors' for the others.

Solution Steps

• 1.Take one piece (3 links) and open all 3 links ($6).
• 2.Use these 3 open links to join the remaining 4 pieces together.
• 3.Close those 3 links ($9).

Logic Breakdown

Total cost: $6 + $9 = $15. By completely dismantling one piece, we get 3 connectors which is exactly what's needed to join 4 separate pieces.

Pattern Learned

Thinking outside the box / Resource sacrifice.

Interview Script

"Instead of joining pieces at their ends, I'll take one piece and break it apart completely. Those three individual links can then be used to bridge the gaps between the other four pieces, saving us one full open/close cycle."

Common Mistakes

• Assuming you must keep all pieces intact.
• Calculating $20 as the only option.

Related Variations

• 6 pieces of 4 links.
• Varying costs for opening vs closing.

Category 3: Measurement & Time

13

Water Jug Problem (4L and 9L)

The Problem

You have two unmarked jugs (4L and 9L) and unlimited water. How do you measure exactly 6 liters?

Your First Instinct

"Try to eyeball half a jug (Never allowed in puzzles!)."

The Key Insight

You can use the jugs to 'subtract' volumes from each other repeatedly.

Solution Steps

• 1.Fill the 9L jug.
• 2.Pour from 9L into 4L until 4L is full. (5L left in 9L).
• 3.Empty the 4L jug.
• 4.Pour the 5L from the 9L into the 4L. (1L left in 9L).
• 5.Empty the 4L jug.
• 6.Pour the 1L from the 9L into the 4L.
• 7.Fill the 9L jug.
• 8.Pour from 9L into the 4L (which already has 1L) until 4L is full. (9 - 3 = 6L left in 9L).

Logic Breakdown

By using the 4L jug as a 'measuring cup' to remove specific amounts from the 9L jug, we eventually reach the target. This is a state-space search problem.

Pattern Learned

State-space search and Diophantine equations.

Interview Script

"I'll use the 9L jug as my primary container and the 4L jug to subtract volume. After two subtractions and a transfer, I'm left with 1L. I'll then fill the 9L jug and pour out exactly 3L (to fill the 4L jug), leaving me with exactly 6L."

Common Mistakes

• Assuming you can mark the jugs.
• Losing track of the water levels during transfers.

Related Variations

• 3L and 5L to get 4L (Die Hard 3 puzzle).
• General case: Can you measure 'Z' using 'X' and 'Y'?

14

Burning Ropes for 45 Minutes

The Problem

Two ropes, each takes 60 mins to burn but at non-uniform rates. How do you measure 45 minutes?

Your First Instinct

"Burn 3/4th of a rope (Impossible because burn rate is non-uniform)."

The Key Insight

A rope burned from both ends will finish in exactly half its total time, regardless of the burn rate.

Solution Steps

• 1.Light Rope A at both ends and Rope B at one end.
• 2.When Rope A finishes (30 mins have passed), Rope B has 30 mins of burn time left.
• 3.Immediately light the other end of Rope B.
• 4.When Rope B finishes, exactly 15 more minutes have passed (Total 45).

Logic Breakdown

Lighting both ends doubles the burn rate, effectively halving the time. This works even if one half burns in 1 min and the other in 59 mins.

Pattern Learned

Parallel processing and rate doubling.

Interview Script

"I'll light the first rope at both ends and the second at one end. The first rope acts as a 30-minute timer. Once it's gone, I know the second rope has 30 minutes left. By lighting its other end, I turn that 30 minutes into 15."

Common Mistakes

• Assuming the rope burns at a constant speed.
• Trying to measure the rope's length.

Related Variations

• Measure 15 minutes.
• Measure 75 minutes.

15

Two Hourglasses (4 and 7 Minutes)

The Problem

How do you measure exactly 9 minutes using a 4-minute and a 7-minute hourglass?

Your First Instinct

"Wait for 7 to end, then try to guess 2 minutes from the 4."

The Key Insight

You can 'store' time in an hourglass by stopping it (flipping it) when another one ends.

Solution Steps

• 1.Start both hourglasses.
• 2.When 4 ends (4 mins), flip it. (7 has 3 mins left).
• 3.When 7 ends (7 mins), flip it. (4 has 1 min left).
• 4.When 4 ends (8 mins), flip 7. (7 has been running for 1 min).
• 5.When 7 ends, exactly 1 more minute has passed. (Total 9).

Logic Breakdown

Total time: 4 (first 4) + 3 (rest of 7) + 1 (rest of 4) + 1 (the 1 min we 'measured' in 7) = 9 minutes.

Pattern Learned

Relative time measurement.

Interview Script

"I'll run both simultaneously. When the 4-minute one ends, I know the 7-minute one has 3 minutes left. By flipping them strategically, I can isolate a 1-minute interval and add it to the 8 minutes I've already tracked."

Common Mistakes

• Not realizing you can flip an hourglass before it's empty.
• Simple addition/subtraction without considering the 'running' state.

Related Variations

• Measure 1 minute.
• Measure 11 minutes.

Category 4: Weighing & Finding

17

Eight Balls Problem

The Problem

8 identical balls, one is heavier. Find the heavy ball in only 2 weighings using a balance scale.

Your First Instinct

"Split into 4 vs 4 (1st weighing), then 2 vs 2 (2nd), then 1 vs 1 (3rd). (3 weighings)."

The Key Insight

A balance scale has three outcomes (Left, Right, Equal), so you should split into three groups, not two.

Solution Steps

• 1.Split balls into groups of 3, 3, and 2.
• 2.Weigh 3 vs 3. If they balance, the heavy ball is in the group of 2.
• 3.If they don't balance, the heavy ball is in the heavier group of 3.
• 4.From the heavy group, pick 2 balls and weigh 1 vs 1. If they balance, the 3rd ball is heavy.

Logic Breakdown

By splitting into 3 groups, you maximize the information gained from each weighing. This is a base-3 search (Ternary Search).

Pattern Learned

Ternary logic and information maximization.

Interview Script

"Instead of a binary split, I'll use a ternary split. By weighing 3 against 3, I can eliminate 6 balls in one go if they balance, or narrow it down to 3 if they don't. This allows me to find the ball in just two steps."

Common Mistakes

• Defaulting to binary search (2 groups).
• Not considering the 'Equal' outcome as a source of information.

Related Variations

• 9 balls (still 2 weighings).
• 27 balls (3 weighings).

19

Ten Bottles with Poisoned Pills

The Problem

10 bottles of pills. 9 have 10g pills, 1 has 9g pills. You have a digital scale (exact weight). Find the light bottle in 1 weighing.

Your First Instinct

"Weigh each bottle one by one."

The Key Insight

You can encode the bottle number into the total weight by taking a different number of pills from each.

Solution Steps

• 1.Take 1 pill from Bottle 1, 2 from Bottle 2, ..., 10 from Bottle 10.
• 2.Total pills = 55. Expected weight if all were 10g = 550g.
• 3.Weigh the 55 pills.
• 4.The difference (550 - actual weight) is the bottle number.

Logic Breakdown

If Bottle 3 is light, the total weight will be 550 - 3(1) = 547g. The 'missing' weight directly points to the bottle index.

Pattern Learned

Weighted sums and unique encoding.

Interview Script

"I'll take a unique number of pills from each bottle—1 from the first, 2 from the second, and so on. This way, the total weight deficit will uniquely identify which bottle the lighter pills came from."

Common Mistakes

• Trying to use a balance scale instead of a digital scale.
• Taking only 1 pill from each bottle.

Related Variations

• Two light bottles (requires more complex encoding).
• Infinite pills per bottle.

Category 5: River Crossing

20

Farmer, Goat, Wolf, and Cabbage

The Problem

A farmer needs to cross a river with a goat, a wolf, and a cabbage. Boat carries him and one item. Wolf eats goat, goat eats cabbage if left alone. How to cross safely?

Your First Instinct

"Take the wolf first, then the cabbage."

The Key Insight

You can bring an item BACK to the starting side to prevent a conflict.

Solution Steps

• 1.Take the Goat across.
• 2.Return alone.
• 3.Take the Wolf across.
• 4.Return with the Goat.
• 5.Take the Cabbage across.
• 6.Return alone.
• 7.Take the Goat across.

Logic Breakdown

The key move is Step 4. By bringing the goat back, you keep it away from the wolf (on the other side) and the cabbage (on the starting side).

Pattern Learned

State management and backtracking.

Interview Script

"I'll start by moving the only 'safe' item—the goat. Then, to move the wolf without it eating the goat, I'll swap them on the other side. I'll bring the goat back, leave it, and take the cabbage. Finally, I'll come back for the goat."

Common Mistakes

• Leaving the wolf and goat together.
• Leaving the goat and cabbage together.

Related Variations

• Cannibals and Missionaries.
• Bridge and Torch (similar constraints).

Category 6: Trick & Wordplay

22

Fake ₹500 Note

The Problem

Customer buys ₹200 goods with fake ₹500 note. Shopkeeper gets change from neighbor. Later, neighbor finds it's fake and shopkeeper pays him back ₹500. Total loss?

Your First Instinct

"₹1000 (₹500 to neighbor + ₹200 goods + ₹300 change)."

The Key Insight

The neighbor is a 'net zero' in this equation. Focus only on the shopkeeper and the customer.

Solution Steps

• 1.Customer gets: ₹200 goods + ₹300 change = ₹500 value.
• 2.Shopkeeper gives: ₹200 goods + ₹300 change = ₹500 value.
• 3.Neighbor gives ₹500, then takes back ₹500 (Net 0).

Logic Breakdown

The shopkeeper's total loss is exactly what the customer gained: ₹500. The transaction with the neighbor was just a temporary loan.

Pattern Learned

Accounting logic and boundary setting.

Interview Script

"If we look at the system as a whole, the neighbor neither gained nor lost anything. The customer walked away with ₹200 in goods and ₹300 in cash. Since that value had to come from somewhere, it came entirely from the shopkeeper. Total loss: ₹500."

Common Mistakes

• Double-counting the ₹500 paid to the neighbor.
• Forgetting to include the cost of goods.

Related Variations

• The missing dollar riddle.
• The horse trading puzzle.

23

Man Marrying His Widow's Sister

The Problem

A man living in California cannot legally marry his widow's sister. Why not?

Your First Instinct

"There's a specific California law against it."

The Key Insight

Read the definitions carefully.

Solution Steps

• 1.Define 'Widow': A woman whose husband has died.
• 2.If the man has a widow, he is dead.

Logic Breakdown

A dead man cannot marry anyone.

Pattern Learned

Lateral thinking - checking preconditions.

Interview Script

"This is a play on words. For a man to have a 'widow,' he must be deceased. Therefore, he's in no position to be getting married!"

Common Mistakes

• Searching for legal reasons.
• Assuming the man is still alive.

Related Variations

• How many birthdays does the average man have?
• Some months have 31 days, how many have 28?

25

Taking Three Pills

The Problem

A doctor gives you three pills and tells you to take one every half hour. How many minutes pass from the first to the last?

Your First Instinct

"90 minutes (3 * 30)."

The Key Insight

The first pill is taken at T=0.

Solution Steps

• 1.Pill 1: 0 minutes.
• 2.Pill 2: 30 minutes.
• 3.Pill 3: 60 minutes.

Logic Breakdown

There are only two 30-minute intervals between three pills.

Pattern Learned

Fencepost error (Off-by-one).

Interview Script

"It's a classic fencepost problem. We have three 'posts' (pills) but only two 'fences' (intervals). So it takes exactly 60 minutes."

Common Mistakes

• Multiplying 3 by 30.
• Not accounting for the immediate first dose.

Related Variations

• Clock striking 6 takes 6 seconds, how long for 12?
• Building a fence with 10 segments.