Description:

Alice has n candies, where the ith candy is of type candyType[i]. Alice noticed that she started to gain weight, so she visited a doctor.

The doctor advised Alice to only eat n / 2 of the candies she has (n is always even). Alice likes her candies very much, and she wants to eat the maximum number of different types of candies while still following the doctor's advice.

Given the integer array candyType of length n, return the maximum number of different types of candies she can eat if she only eats n / 2 of them.

Solution:

Time Complexity : O(n)
Space Complexity: O(n)

// Add candy types to a set to get a list of only unique values
// Return the minimum between the size of the set and the maximum numbers of candies allowed to eat
var distributeCandies = function(candyType) {
    const set = new Set();
    for(const type of candyType) {
        set.add(type)
    }
    return Math.min(set.size, candyType.length / 2)
};