10 Mice, 1000 Bottles, and the Binary Trick That Exposes CRUD-Only Backend Engineers

The question is a fast proxy for whether a backend candidate internalizes bitwise reasoning and space-time tradeoffs. Engineers who can't map a set of binary states onto a lookup problem will struggle with bitmaps, Bloom filters, and the kind of compact data structures that keep high-scale systems from falling over.

The classic puzzle — one poisoned bottle hidden among 1,000, with mice that die exactly one hour after drinking — has a precise answer: 10 mice. Each bottle gets a 10-bit binary label. A mouse drinks from a pool containing a drop of every bottle whose nth bit is 1. After the poison takes effect, the pattern of dead mice reads out as the binary index of the poisoned bottle. 2^10 = 1024 states, which covers all 1,000 bottles with room to spare.

ByteDance and other large Chinese tech firms use this question to filter for engineers who understand information density, not just procedural logic. The setup mirrors a bitmap or Bloom filter: a tiny bit array encodes membership across a large set. Ten bits resolve 1,000 possibilities in one parallel round, trading a small amount of space for zero additional time.

The trap answer is 20 or some linear-search count. The right answer signals that the candidate thinks in state-space compression and bitwise operations — the same instincts that separate engineers who build high-throughput systems from those who only write CRUD wrappers.