Sorting followed by Sliding Window Approach
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        if(nums.length <= 1) return 0;\n        \n       Arrays.sort(nums);\n       int minDifference = Integer.MAX_VALUE;\n       int left = 0;\n       for(int right = 0; right < nums.length; right++) {\n\n           if(right < k - 1) continue;\n\n           minDifference= Math.min(minDifference, nums[right] - nums[left]);\n           left++;\n       }\n       return minDifference;\n    }\n}\n```
['Java']