Search⌘ K
AI Features

Solution: Poor Pigs

Understand how to determine the least number of pigs needed to identify a poisonous bucket efficiently by analyzing possible test outcomes across timed rounds. This lesson guides you through computing rounds, possible states, and applying logarithmic calculations to solve the problem with optimal time and space complexity.

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 ...