Leetcode 3397. Maximum Number of Distinct Elements After Operations

Given nums and k, you may shift each element by any integer in [-k,k] at most once; maximize the number of distinct final values. This is equivalent to assigning each element a value inside its interval [num-k, num+k] to maximize distinct assignments — a greedy interval-assignment/packing problem.