There are n washing machines arranged in a line. You are given an integer array machines where machines[i] denotes the number of dresses in the $i^{ ext{th}}$ washing machine.

In a single move, you can select any subset of machines and simultaneously transfer $1$ dress from each selected machine to any one of its adjacent machines.

Return the minimum number of moves needed to equalize the number of dresses in all washing machines. If it is impossible to make every machine contain an equal number of dresses, return $-1$.

Constraints:

• n $=$ machines.length

• $1 \leq$ n $\leq 10^4$

• $0 \leq$ machines[i] $\leq 10^5$

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.