← Amazon questions

Split array to minimize difference of part sums

Filed under Amazon

Given an integer array, find an index i such that the absolute difference between the sum of elements from index 0 to i and the sum of elements from i+1 to n-1 is minimized.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.