Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns

Solution: Poor Pigs

Understand how to determine the smallest number of pigs required to identify a poisonous bucket within a given time by analyzing rounds of testing and possible outcomes. This lesson applies logarithmic calculations and problem-solving logic to optimize resource use in this classic math and geometry coding challenge.

We'll cover the following...

Statement

You have buckets buckets of liquid, exactly one of which is poisonous. Your goal is to identify the poisonous bucket by feeding liquid to some number of pigs and observing whether they survive or die. You have a total of minutesToTest minutes to determine which bucket contains the poison.

The experiment proceeds in rounds according to the following rules:

  • Select any number of live ...