You are given an integer array nums. In one operation, you may pick two equal integers from nums and remove them from the array.

Repeat this operation until no further pairs of equal integers can be formed.

Return an integer array of size $2$ where the first element is the total number of pairs removed and the second element is the number of leftover integers remaining in nums.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $0 \leq$ nums[i] $\leq 100$

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.