Make array elements distinct with minimal sum increase
Filed under Samsung
The question
Given an array of elements, modify it so all elements are distinct. Any replaced value must be greater than its previous value, and the final sum of the array elements must be minimized.
No write-up yet. Related questions below have one.
Related Samsung questions
Collected from public candidate posts and coding forums. Updated Nov 2026.