You are given a $0$ indexed array of positive integers nums.

The array nums is considered alternating if:

• nums[i] is equal to nums[i - 2] for all $2 \leq i <$ nums.length

• nums[i] is not equal to nums[i - 1] for all $1 \leq i <$ nums.length

In one operation, you can choose any index i and change nums[i] to any positive integer.

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

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.