Alice has n candies, where the candy at index i is of type candyType[i]. She is permitted to eat at most $n / 2$ of her candies (n is always even).

Alice wants to maximize the number of distinct candy types she can eat while following this restriction.

Given the integer array candyType of length n, return the maximum number of unique candy types she can eat if she eats $n / 2$ candies.

Constraints:

• n == candyType.length

• $2 \leq$ n $\leq 10^4$

• n is even.

• $-10^5 \leq$ candyType[i] $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.