Good Job Bro,Now Let Me Help You!!
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def minimumDifference(self, nums: List[int], k: int) -> int:\n        final=[]\n        nums.sort()\n        for i in range(len(nums)-(k-1)):\n            help=nums[i:i+k]\n            score=max(help)-min(help)\n            final.append(score)\n            #print(help)\n        #print(final)\n        return min(final)\n```
['Python3']