You are given an integer n, representing the length of an array arr where arr[i] = (2 \cdot i) + 1 for all $0 \leq$ i $<$ n.

In a single operation, you can choose two indices x and y such that $0 \leq$ x, y $<$ n, decrement arr[x] by $1$, and increment arr[y] by $1$.

Return the minimum number of operations required to make all elements of arr equal.

Constraints:

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

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.