Available question text
Find an integer cap such that replacing every element greater than the cap with the cap makes the array's sum as close as possible to the target (tie-breaker: choose the smaller cap). The mutated sum is monotonic in the cap, enabling a search over possible cap values.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1300. Sum of Mutated Array Closest to Target
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source