Python Easiest Solution | 96.98 % Faster | Sliding Window | Beg To adv
python\nclass Solution:\n    def minimumDifference(self, nums: List[int], k: int) -> int:\n        nums.sort()\n        l, r = 0, k-1\n        \n        min_dif
```python\nclass Solution:\n    def minimumDifference(self, nums: List[int], k: int) -> int:\n        nums.sort()\n        l, r = 0, k-1\n        \n        min_diff = float(\'inf\') # max out possible value\n        \n        while r < len(nums):\n            min_diff = min(min_diff, nums[r] - nums[l])\n            l, r = l+1, r+1\n            \n        return min_diff \n```\nTo read more about "float("inf")". \nhttps://stackoverflow.com/questions/34264710/what-is-the-point-of-floatinf-in-python\n\n***Found helpful, Do upvote !!***
['Sliding Window', 'Python', 'Python3']