Sum of Mutated Array Closest to Target
Explore how to determine an integer value for mutating an array to get its sum closest to a target. Understand problem-solving with sorting, binary search, and tie-breaking rules for optimal solutions.
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:
...