You are given a binary array nums.

In one operation, you can choose any index i and flip every element from index i to the end of the array (changing every $0$ to $1$ and every $1$ to $0$).

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

Constraints:

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

• $0 \leq$ nums[i] $\leq 1$

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.