Search
⌘K
Get Premium
Leetcode 3366. Minimum Array Sum
Given nums and limits op1/op2, you may apply at most op1 operations that replace nums[i] with ceil(nums[i]/2) and at most op2 operations that subtract k from nums[i] (only allowed if nums[i] >= k), with each operation usable at most once per index and both operations allowed on the same index. Find the assignment of these operations that yields the minimum possible sum of the array.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.