Python Solution
Intuition\nThe hardest issue was trying to figure out how to calculate the difference, based on the number of k students, no matter the size of the list. And th
# Intuition\nThe hardest issue was trying to figure out how to calculate the difference, based on the number of k students, no matter the size of the list. And then check each difference and compare it to the minimum difference, and then return the lowest possible difference. \n\n# Approach\nSimple usage of python built in functions for sorting nums and calculating the min diff, and then return the min diff after comparing it to each possible difference calcultion\n\n# Code\n```\nclass Solution:\n    def minimumDifference(self, nums: List[int], k: int) -> int:\n        nums = sorted(nums)\n        return_diff = float(\'inf\')\n        for num in range(len(nums)-k + 1):\n            current_diff = nums[num+k-1] - nums[num]\n            if current_diff < return_diff:\n                return_diff = current_diff\n\n        return return_diff\n\n\n```
['Python3']