You are given an integer array nums.

In one operation, you can remove the first $3$ elements of nums. If nums contains fewer than $3$ elements, all remaining elements are removed.

You repeat this operation until all elements in nums are distinct.

Return the minimum number of operations needed to make all elements in nums distinct.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

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