Given a $0$ indexed integer array nums, find the leftmost middleIndex such that the sum of the elements strictly to the left of middleIndex equals the sum of the elements strictly to the right of middleIndex.

If middleIndex is $0$, the left sum is considered to be $0$. Similarly, if middleIndex is equal to nums.length $- 1$, the right sum is considered to be $0$.

Return the leftmost middleIndex that satisfies these conditions, or $-1$ if no such index exists.

Note: This question is identical to Pivot Index.

Constraints:

• $1 \le$ nums.length $\le 100$

• $-1000 \le$ nums[i] $\le 1000$

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.