Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3397. Maximum Number of Distinct Elements After Operations
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source