Problem · Array
Minimum Absolute Sum
● Easy
GoogleNEW GRADINTERNOA
See Google hiring insightsGoogleNEW GRADINTERNOAProblem statement
There is an array A consisting of N integers. Choose at most one element to multiply by -1 in order to obtain an array whose sum of elements is as close to 0 as possible. That is, find the sum with the minimum absolute value.
The problem statement continues
ProExamples
Example 1
A = [1, 3, 2, 5]return = 1Negating 5 changes the total from 11 to 1, which is optimal.
2 original screenshots from the interview report
ProFastPrep Pro
Reported in 1 Google interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 3 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week