You are given an integer array nums indexed from $0$. In one operation, you can choose any element of nums and move it to the end of the array.

Return the minimum number of operations required so that every prefix sum of nums is greater than or equal to $0$.

Note: The test cases are generated such that it is always possible to make all prefix sums greater than or equal to $0$.

Constraints:

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