# Poor Pigs: Walkthrough
Poor Pigs shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Each pig is a digit in base (minutesToTest/minutesToDie + 1): that many tests plus a “survived all” state. With b states per pig you can distinguish b^pigs buckets, so you need ceil(log(buckets)/log(b)) pigs.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(1).
## Common mistake
Thinking you need one pig per bucket, or using a binary (alive/dead once) encoding when you actually get several test rounds.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at real-time AI interview assistant for live interviews.