Rabbits in Forest Python Solution with Tests

lcpy gen -n 781   # by problem number
lcpy gen -s rabbits_in_forest   # by problem name

Input: answers = [1,1,2]
Output: 5
Explanation:
The two rabbits that answered "1" could both be the same color, say red.
The rabbit that answered "2" can't be red or the answers would be inconsistent.
Say the rabbit that answered "2" was blue.
Then there should be 2 other blue rabbits in the forest that didn't answer into the array.
The smallest possible number of rabbits in the forest is therefore 5: 3 that answered plus 2 that didn't.

Input: answers = [10,10,10]
Output: 11

from collections import Counter


class Solution:
    # Time: O(n)
    # Space: O(k)
    def num_rabbits(self, answers: list[int]) -> int:
        total = 0
        for answer, count in Counter(answers).items():
            group_size = answer + 1
            total += -(-count // group_size) * group_size
        return total