Solution: Sum of Mutated Array Closest to Target
Explore how to solve the problem of mutating an array so its sum closely matches a target value. Learn to use sorting and strategic replacement to minimize the difference between the mutated sum and the target while managing edge cases. Understand time and space complexities of this approach.
We'll cover the following...
We'll cover the following...
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:
arr.length...