Equilibrium Point

The Balanced Pivot (Equilibrium)

Imagine you are a tightrope walker trying to find the perfect point of balance. In an array, the "Equilibrium Point" is an index where the sum of all elements to its left is exactly equal to the sum of all elements to its right. Finding this point allows us to "split" a dataset into two equally weighted halves.

The Assignment

Your mission is to find the index of balance. Your function receives an array nums.

1. Calculate the total sum of every number in the array.
2. Iterate through the array using a loop, keeping a running leftSum.
3. In each step, calculate the rightSum using the logic: TotalSum - leftSum - currentElement.
4. If the leftSum matches the rightSum, print the current index and exit.
5. If you finish the loop without finding a match, print -1.