Given an array of integers, increment any duplicate elements until all elements are unique.
Given an array of integers, increment any duplicate elements until all elements are unique. The task is to minimize the sum of the array after making all elements unique.
Example:
// With the input
[7, 2, 1, 2, 4, 3]
// Increment a 2 to get
[7, 2, 1, 3, 4, 3]
// Increment a 3 to get
[7, 2, 1, 3, 4, 4]
// Increment a 4 to get
[7, 2, 1, 3, 4, 5]
// every element is now unique
// => sum : 22
# | Size | % | Users |
---|---|---|---|
#1 | 43 c. | Top 12% | |
#2 | 46 c. | Top 18% | |
#3 | 53 c. | Top 29% | |
#4 | 54 c. | Top 41% | |
#5 | 59 c. | Top 47% | |
#6 | 72 c. | Top 53% | |
#7 | 78 c. | Top 59% | |
#8 | 79 c. | Top 65% | |
#9 | 80 c. | Top 71% | |
#10 | 83 c. | Top 76% | |
#11 | 95 c. | Top 82% | |
#12 | 114 c. | Top 88% | |
#13 | 181 c. | Top 94% | |
#14 | 447 c. | Top 100% |