Faster than 89.9% java submission  easy understandable java code
class Solution {\n    public int minimumDifference(int[] nums, int k) {\n     if(k==0)\n        return 0;\n        Arrays.sort(nums);\n        int n = nums.leng
class Solution {\n    public int minimumDifference(int[] nums, int k) {\n     if(k==0)\n        return 0;\n        Arrays.sort(nums);\n        int n = nums.length,i=0,mn=Integer.MAX_VALUE;\n        \n        for(i=0;i<=n-k;i++)\n        {\n            mn = Math.min(mn,nums[i+k-1]-nums[i]);\n        \n        }\n        \n        return mn;\n    }\n}\n/////**** If You like the solution please hit up the like button ****////\nfeel free to ask any question or send any another approach
['Java']