Sum of Mutated Array Closest to Target
Explore how to determine a mutation value for an integer array to make its sum closest to a target number. Learn to apply sorting and binary search techniques to efficiently solve the problem. This lesson guides you through understanding the requirements, handling edge cases, and implementing the solution in code.
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:
...