You are given a circular integer array balance of size n.

In one move, you can transfer $1$ unit from an index i with balance[i] $> 0$ to an adjacent index (either (i + 1) % n or (i - 1 + n) % n).

Return the minimum number of moves required to make every element in balance greater than or equal to $0$, or $-1$ if it is impossible.

Constraints:

• $1 \leq n ==$ balance.length $\leq 10^5$

• $-10^9 \leq$ balance[i] $\leq 10^9$

• There is at most $1$ negative value in balance initially.

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.