Minimize Sum with Operations | Dataford Interview Questions

Given an array of integers and an integer k, perform exactly k operations (remove an element, divide it by 2 and take the ceiling, add it back) to minimize the sum. Return the minimum possible sum.

Asked in the DSA round 1 stage.

Implement def minimize_sum(nums, k):, where nums is a list of non-negative integers and k is a non-negative integer. Return the minimum possible integer sum after exactly k operations. An element may be selected repeatedly. Use a max heap to efficiently select the current largest value.

Constraints

1 <= len(nums) <= 1000
0 <= nums[i] <= 10^9
0 <= k <= 10^5
An element may be selected more than once

Function Signature

def minimize_sum(nums, k):

Your question is Minimize Sum with Operations. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Given an array of integers and an integer k, perform exactly k operations (remove an element, divide it by 2 and take the ceiling, add it back) to minimize the sum. Return the minimum possible sum.

Asked in the DSA round 1 stage.

Constraints

1 <= len(nums) <= 1000
0 <= nums[i] <= 10^9
0 <= k <= 10^5
An element may be selected more than once

Function Signature

def minimize_sum(nums, k):

Your question is Minimize Sum with Operations. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.