How should I practice Equal Sum Split After One Removal?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google phone screen problems in FastPrep.

Is Equal Sum Split After One Removal associated with Google?

FastPrep tags this as a Google phone screen coding practice problem when the problem catalog has that company and stage context.

Problem · Array

● Medium

GoogleINTERNPHONE SCREEN

Given an array nums of positive integers, remove exactly one element while preserving the relative order of all remaining elements.

Return true if the remaining sequence can be split into two non-empty contiguous subarrays with equal sums. Otherwise, return false.

You may choose any one index to remove.
After the removal, every remaining element must belong to exactly one of the two subarrays.
Both subarrays must be contiguous in the remaining sequence.

canSplitAfterRemoval(nums: int[]) → boolean

nums = [1,2,3,3]return = true

Remove the last 3. The remaining sequence is [1,2,3], which splits into [1,2] and [3]. Both sums are 3.

nums = [1,2,5]return = false

Every removal leaves two unequal single-element subarrays, so no valid split exists.

nums = [2,1,1,2]return = true

Remove the first 2. The remaining sequence [1,1,2] splits into [1,1] and [2], each with sum 2.