Available question text
Given an integer array where you may replace any two elements arbitrarily, minimize the sum of the maximum and minimum pairwise absolute differences (which, since you can create duplicates, reduces to minimizing the array range after two edits). This is solved by sorting and considering which two endpoints to adjust to get the smallest possible max−min.
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 2567. Minimum Score by Changing Two Elements
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source