You are given an integer array nums. In one operation, you can replace any element in nums with any other integer.

The array nums is considered continuous if both of the following conditions are satisfied:

• All elements in nums are unique.

• The difference between the maximum element and the minimum element in nums equals nums.length $- 1$.

Return the minimum number of operations required to make nums continuous.

Constraints:

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

• $1 \leq$ nums[i] $\leq 10^9$

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.