Minimum Difference Between Highest and Lowest

lcpy gen -n 1984   # by problem number
lcpy gen -s minimum_difference_between_highest_and_lowest_of_k_scores   # by problem name

Input: nums = [90], k = 1
Output: 0
Explanation: There is one way to pick score(s) of one student:
- [90]. The difference between the highest and lowest score is 90 - 90 = 0.
The minimum possible difference is 0.

Input: nums = [9,4,1,7], k = 2
Output: 2
Explanation: There are six ways to pick score(s) of two students:
- [9,4,1,7]. The difference between the highest and lowest score is 9 - 4 = 5.
- [9,4,1,7]. The difference between the highest and lowest score is 9 - 1 = 8.
- [9,4,1,7]. The difference between the highest and lowest score is 9 - 7 = 2.
- [9,4,1,7]. The difference between the highest and lowest score is 4 - 1 = 3.
- [9,4,1,7]. The difference between the highest and lowest score is 7 - 4 = 3.
- [9,4,1,7]. The difference between the highest and lowest score is 7 - 1 = 6.
The minimum possible difference is 2.

class Solution:
    # Time: O(n log n)
    # Space: O(n) for the sort
    def minimum_difference(self, nums: list[int], k: int) -> int:
        scores = sorted(nums)
        return min(scores[i + k - 1] - scores[i] for i in range(len(scores) - k + 1))