Equal Side Sum Index | Dataford Interview Questions

Given an array of numbers (assume the array has three or more values), should return an index where the sums of the elements on either side of that index are equal; how would you solve it for examples like [2, 3, 4, 4, 1]?

Implement find_pivot_index(nums). Return any valid index, or -1 when no such index exists. The pivot value itself is excluded from both sums. Input is a list of integers, and output is an integer index.

Constraints

3 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
Return any valid pivot index if multiple indices qualify
Return -1 when no valid pivot index exists

Function Signature

def find_pivot_index(nums):

Your question is Equal Side Sum Index. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Constraints

3 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
Return any valid pivot index if multiple indices qualify
Return -1 when no valid pivot index exists

Function Signature

def find_pivot_index(nums):

Your question is Equal Side Sum Index. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.