Difficulty – Hard

Hard brain teasers and puzzles

Tennis Match Mystery

Abe, Ben, and Catelyn were playing 1-on-1 tennis matches one afternoon. After each match, the winner stayed on the court and the loser was replaced by the person who sat out.

At the end of their session, Abe had played 8 matches, Ben had played 12 matches, and Catelyn had played 14 matches. Ben was particularly exhausted as he had played all of the last 7 matches.

Is it possible to figure out who played and who won in the 4th match?

Continue reading “Tennis Match Mystery”

5 Pirates Puzzle

Five pirates are figuring out how to divide up a newly plundered treasure of 100 gold coins. From most senior to least senior: Pirate A, Pirate B, Pirate C, Pirate D, and Pirate E. The rules:

  1. The most senior pirate must propose a distribution (for example, giving himself all 100 gold coins and 0 for everyone else), and then all the pirates must vote on it.
  2. If at least half of the pirates vote for a proposal, the proposal is accepted and the gold is split according to that distribution.
  3. Otherwise, if the proposal is rejected, the pirate that proposed it is kicked out, and this process repeats with the remaining pirates.
  4. Each pirate’s main goal is to maximize the gold they receive (but a pirate that is kicked out gets no gold), but are also spiteful enough to prefer kicking out the other pirates, all else equal. The pirates are also distrustful of each other and will not make any side deals, so the distribution of an accepted proposal is final.

What is the greatest number of coins that Pirate A can distribute to himself?


This is a classic logic puzzle, occasionally encountered in tech interviews many years ago.

Preparing for a brain teaser interview? Check out our ultimate guide to brain teaser interviews.

Continue reading “5 Pirates Puzzle”