You are given a $0$ indexed circular array nums containing $n$ integers.

In each second, for every index i from $0$ to $n - 1$ simultaneously, you can replace the value at nums[i] with any of the following values:

• nums[i]

• nums[(i - 1 + n) % n]

• nums[(i + 1) % n]

Return the minimum number of seconds required to make all elements in nums equal.

Constraints:

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