Distribute Candies Python Solution with Tests

lcpy gen -n 575   # by problem number
lcpy gen -s distribute_candies   # by problem name

Input: candyType = [1,1,2,2,3,3]
Output: 3
Explanation: Alice can only eat 6 / 2 = 3 candies. Since there are only 3 types, she can eat one of each type.

Input: candyType = [1,1,2,3]
Output: 2
Explanation: Alice can only eat 4 / 2 = 2 candies. Whether she eats types [1,2], [1,3], or [2,3], she still can only eat 2 different types.

Input: candyType = [6,6,6,6]
Output: 1
Explanation: Alice can only eat 4 / 2 = 2 candies. Even though she can eat 2 candies, she only has 1 type.

class Solution:
    # Time: O(n)
    # Space: O(n)
    def distribute_candies(self, candy_type: list[int]) -> int:
        return min(len(set(candy_type)), len(candy_type) // 2)