Problem: Sum of Mutated Array Closest to Target

med

30 min

Understand how to determine a mutation value to replace elements in an array greater than this value, so the resulting sum is closest to the target. Learn to apply sorting and binary search to efficiently solve this problem, practicing your skills in problem assessment and algorithm implementation.

Statement

Given an integer array arr and a target value target, find an integer value such that if all the numbers in arr greater than value are replaced with a value, the sum of the array gets as close as possible to the target.

Choose the smaller value if there’s a tie (two value options are equally close to the targe).

Note: The answer doesn’t have to be a number from the array.

Constraints:

$1 \leq$ arr.length $\leq 10^3$
$1 \leq$ arr[i], target $\leq 10^4$

Problem: Sum of Mutated Array Closest to Target

med

30 min

Statement

Choose the smaller value if there’s a tie (two value options are equally close to the targe).

Note: The answer doesn’t have to be a number from the array.

Constraints:

$1 \leq$ arr.length $\leq 10^3$
$1 \leq$ arr[i], target $\leq 10^4$

Problem: Sum of Mutated Array Closest to Target

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: Sum of Mutated Array Closest to Target

Statement

Examples

Understand the problem

Figure it out!

Try it yourself