Minimum Difference Between Highest And Lowest of K Scores
You are given a 0-indexed integer array nums, where nums[i] represents the score of the ith student. You are also given an integer k.
Pick the scores of any k students from the array so that the difference between the highest and the lowest of the k scores is minimized.
Return the minimum possible difference.
Example 1:
Input: nums = [2,5,3,1,6,3], k = 3
Output: 1Explanation: We can pick [2,3,3], whose score is 1 which is minimum among all combinations.
Example 2:
Input: nums = [9,4,1,7], k = 2
Output: 2Explanation: We can pick [9,7], whose score is 2 which is minimum among all combinations.
Constraints:
1 <= k <= nums.length <= 10000 <= nums[i] <= 100,000