Problem
Submissions

Problem: Sum of Mutated Array Closest to Target

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≤1 \leqarr.length ≤103 \leq 10^3

  • 1≤1 \leqarr[i], target ≤104\leq 10^4

Problem
Submissions

Problem: Sum of Mutated Array Closest to Target

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≤1 \leqarr.length ≤103 \leq 10^3

  • 1≤1 \leqarr[i], target ≤104\leq 10^4