Minimize Total Weight After Halving
Amazonâ—Ź MediumINTERNONSITE INTERVIEWProblem statement
Given an array of positive integer weights, perform exactly operations moves. In each move, choose one element with current weight w and replace it with floor(w / 2). A weight may become 0, and the same element may be chosen again.
The problem statement continues
ProExamples
Example 1
weights = [2,5,10,23]operations = 2return = 22First change 23 to 11, then change that 11 to 5. The sum is 2 + 5 + 10 + 5 = 22.
FastPrep Pro
Reported in 1 Amazon 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
- 1 more worked example, 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