[LeetCode] Sum of Mutated Array Closest to Target

1300. Sum of Mutated Array Closest to Target

Given an integer array arr and a target value target, return the integer value such that when we change all the integers larger than value in the given array to be equal to value, the sum of the array gets as close as possible (in absolute difference) to target.

In case of a tie, return the minimum such integer.

Notice that the answer is not neccesarilly a number from arr.

Read more
[AlgoExpert] Number Of Binary Tree TopologiesRead more
[AlgoExpert] Merge SortRead more
[AlgoExpert] Smallest Substring ContainingRead more
[AlgoExpert] Solve SudokuRead more
[AlgoExpert] Merge Sorted ArraysRead more
[AlgoExpert] Compare Leaf TraversalRead more
[AlgoExpert] Right Smaller ThanRead more
[AlgoExpert] Line Through PointsRead more
[AlgoExpert] Count InversionsRead more