Maximize K-Element AND with an Increment Budget
Amazon● HardFULLTIMEOAProblem statement
You are given an array nums, an integer k, and a nonnegative increment budget budget. You may increase array elements by nonnegative integer amounts whose total is at most budget.
After applying the increments, choose exactly k distinct array positions. Return the maximum possible bitwise AND of the chosen values.
The problem statement continues
ProExamples
Example 1
nums = [5,4,1,7,2]k = 3budget = 3return = 6Increase 4 to 6 and 5 to 6. Choosing 6, 6, 7 gives 6 & 6 & 7 = 6.
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
- 2 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