Leetcode 1984. Minimum Difference Between Highest and Lowest of K Scores

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.