Available question text
Given an array of student scores and an integer k, choose k scores so the difference between the highest and lowest selected score is minimized. This is typically solved by sorting the array and scanning all length-k contiguous windows to find the smallest max−min 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 1984. Minimum Difference Between Highest and Lowest of K Scores
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source