Available question text
Given an integer array and k, choose for each element either +k or -k to minimize the final difference between the maximum and minimum elements. Key insight: after sorting, optimal assignments correspond to a split where left-side elements are raised and right-side elements are lowered, so you search split points to minimize the resulting range.
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 910. Smallest Range II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source