You are given an integer array nums of length n.

In one operation, you can select a contiguous subarray nums[l...r] (where $0 \leq `l` \leq `r` < `n$) and replace every element in that subarray with the bitwise $ ext{AND}$ of all elements in the subarray.

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

Constraints:

• $1 \leq `n` == `nums.length` \leq 100$

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