Given an integer array nums, find the pivot index of the array.

The pivot index is defined as the index where the sum of all elements strictly to its left equals the sum of all elements strictly to its right. If the index lies on the left edge of the array, the left sum is considered $0$ since no elements exist to its left. The same applies when the index lies on the right edge.

Return the leftmost pivot index. If no such index exists, return $-1$.

Constraints:

• $1 \leq$ nums.length $\leq 10^4$

• $-1000 \leq$ nums[i] $\leq 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.