Java easy solution 100% faster || beats 100%.
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    public int minimumDifference(int[] nums, int k) {\n        Arrays.sort(nums);\n        int diff=nums[k-1]-nums[0];\n       int n=nums.length-k+1;\n       int s=0;\n       for(int i=0;i<n;i++)\n       {\n           s=nums[i+k-1] - nums[i];\n           if(diff>s)diff=s;\n       }\n       return diff;\n     }\n}\n```
['Java']