Poor Pigs Python Solution with Tests

lcpy gen -n 458   # by problem number
lcpy gen -s poor_pigs   # by problem name

Input: buckets = 4, minutesToDie = 15, minutesToTest = 15
Output: 2
Explanation: We can determine the poisonous bucket as follows:
At time 0, feed the first pig buckets 1 and 2, and feed the second pig buckets 2 and 3.
At time 15, there are 4 possible outcomes:
- If only the first pig dies, then bucket 1 must be poisonous.
- If only the second pig dies, then bucket 3 must be poisonous.
- If both pigs die, then bucket 2 must be poisonous.
- If neither pig dies, then bucket 4 must be poisonous.

Input: buckets = 4, minutesToDie = 15, minutesToTest = 30
Output: 2
Explanation: We can determine the poisonous bucket as follows:
At time 0, feed the first pig bucket 1, and feed the second pig bucket 2.
At time 15, there are 2 possible outcomes:
- If either pig dies, then the poisonous bucket is the one it was fed.
- If neither pig dies, then feed the first pig bucket 3, and feed the second pig bucket 4.
At time 30, one of the two pigs must die, and the poisonous bucket is the one it was fed.

class Solution:
    # Time: O(log(buckets))
    # Space: O(1)
    def poor_pigs(self, buckets: int, minutes_to_die: int, minutes_to_test: int) -> int:
        states = minutes_to_test // minutes_to_die + 1
        pigs = 0
        covered = 1
        while covered < buckets:
            covered *= states
            pigs += 1
        return pigs