You are given a binary array nums.

In one operation, you can choose any $3$ consecutive elements from nums and flip each of them, changing every $0$ to $1$ and every $1$ to $0$.

Return the minimum number of operations required to make every element in nums equal to $1$. If it is impossible to make all elements equal to $1$, return $-1$.

Constraints:

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