python easy fast solution
class Solution:\n    def minimumDifference(self, nums: List[int], k: int) -> int:\n        nums.sort()\n        i=0\n        j=k-1\n        l=[]\n        while 
class Solution:\n    def minimumDifference(self, nums: List[int], k: int) -> int:\n        nums.sort()\n        i=0\n        j=k-1\n        l=[]\n        while j<len(nums):\n            b=nums[j]-nums[i]\n            l.append(b)\n            i+=1\n            j=k-1+i\n        return min(l)\n        \n
['Sliding Window']