C++ EASY SOLUTION :)
\nclass Solution {\npublic:\n    int minimumDifference(vector<int>& nums, int k) \n    {\n        int diff=INT_MAX;\n        sort(nums.begin(),nums.end());\n   
```\nclass Solution {\npublic:\n    int minimumDifference(vector<int>& nums, int k) \n    {\n        int diff=INT_MAX;\n        sort(nums.begin(),nums.end());\n        \n        int i=0,j=0;\n        \n        while(j<nums.size())\n        {\n            if(j-i+1<k)\n            {\n                j++;\n            }\n            \n            if(j-i+1==k)\n            {\n                diff=min(ans,nums[j]-nums[i]);\n                i++;\n                j++;\n            }\n        }\n               \n         return diff;   \n        \n    }\n};\n```
['C', 'Sliding Window', 'Sorting']