Given an integer array arr, you can choose a set of integers and remove all occurrences of these integers from the array.

Return the minimum size of the set such that at least half of the integers of the array are removed.

Constraints:

• $2 \leq$ arr.length $\leq 10^5$

• arr.length is even.

• $1 \leq$ arr[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.