You are given an integer array nums.

An array is considered positive if the sum of every subarray with a length of at least $3$ is strictly positive (greater than $0$).

In one operation, you can choose any index i and replace nums[i] with any integer.

Return the minimum number of operations required to make nums positive.

Constraints:

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

• $-10^9 \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.