1. Given an array of integers nums, calculate the pivot index of this array. 2. The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of all the numbers strictly to the index's right. 3. If the index is on the left edge of the array, then the left sum is 0 because there are no elements to the left. This also applies to the right edge of the array. 4. Return the leftmost pivot index. If no such index exists, return -1.
Input Format
Input is managed for you
Output Format
Output is managed for you
Constraints
1 <= nums.length <= 104 -1000 <= nums[i] <= 1000
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
6 1 7 3 6 5 6
Output
3