Find the equilibrium index where left sum equals right sum!
An index i is an equilibrium if:
sum(arr[0..i-1]) == sum(arr[i+1..n-1])
Efficient approach:
1. Calculate total sum first
2. Track leftSum while traversing
3. rightSum = totalSum - leftSum - arr[i]
4. If leftSum == rightSum, found equilibrium!