Minimum Difference Between Highest and Lowest of K Scores LeetCode solution in Python

1
class Solution:
2
    def minimumDifference(self, nums: List[int], k: int) -> int:
3
        nums.sort()
4
        m, n = 100001, len(nums)
5
        i, j = 0, k - 1
6
        while j < n:
7
            m = min(m, nums[j] - nums[i])
8
            i += 1
9
            j += 1
10
        return m