Minimum Increment to Make Array Unique
MediumGreedygreedy
Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.
Practice this as a mock interviewFree to start, no account neededProblem
Given an integer array nums, one move picks an index i and increases nums[i] by 1. Return the minimum number of moves needed to make every value in nums distinct.
The answer is guaranteed to fit in a signed 32-bit integer.
Examples
Input: nums = [1,2,2]
Output: 1
Raise one of the 2s to 3.
Input: nums = [3,2,1,2,1,7]
Output: 6
One optimal result is [3,4,1,2,5,7]: a 2 is raised to 4 (2 moves) and a 1 is raised to 5 (4 moves), 6 moves in total.
Constraints
- 1 <= nums.length <= 10^5
- 0 <= nums[i] <= 10^5
What the interviewer grades
A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.