Equal Subarray Split

MediumPython

Problem

Find a split point in an array that makes the subarray sums equal.

Given an integer array nums, return the largest valid split position k such that the non-empty subarrays nums[:k] and nums[k:] have equal sums. Return -1 if no such split exists.

Input and Output

nums is a list of integers. Return an integer split position, counting the number of elements in the left subarray.

Constraints

2 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
Both resulting subarrays must be non-empty
If several valid positions exist, return the largest one

Function Signature

def find_split_point(nums):

CodePython 3

You need to log in / sign up to run or submit.Ln 2

Run your code to see test output here.