Minimum Increment to Make Array Unique

Given an integer array, compute the minimum number of +1 moves needed to make all elements distinct — a problem typically solved by sorting (or counting/bucketing) and greedily pushing duplicates to the next available integers to minimize total increments. Constraints (n, value ≤ 1e5) allow O(n log n) sorting or linear counting solutions.