You are given an integer array nums.

You are permitted to perform the following operation at most $1$ time:
Select two integers x and y, and replace every element in nums that is equal to x with y.

Return the maximum number of adjacent equal pairs (indices i satisfying nums[i] == nums[i + 1]) that can be obtained after applying at most $1$ operation.

Constraints:

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