You are given an integer array nums.

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

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

Note: An empty array is considered to have distinct elements.

Constraints:

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

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