Available question text
Given nums and k where each element can be changed once to any integer in [nums[i]-k, nums[i]+k], find the maximum length of a subsequence of equal values you can obtain — equivalently, determine the value x that lies in the largest number of intervals [nums[i]-k, nums[i]+k] (maximum interval overlap).
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 2779. Maximum Beauty of an Array After Applying Operation
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source