Available question text
Given an array nums and integer k, you may add any value in [-k, k] to each element at most once; find the minimum possible difference between the maximum and minimum elements after these adjustments.
The problem reduces to shrinking the original range by up to 2k, so the answer is max(0, max(nums) - min(nums) - 2k).
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 908. Smallest Range I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source