Java Easy Solution || 100% working
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(k==1) return 0;\n        Arrays.sort(nums);\n        k--;\n        int n = nums.length-k;\n        int ans = 999999;\n        for(int i=0; i<n; i++){\n            int temp = nums[k++]-nums[i];\n            if (ans>temp) ans = temp;\n        }\n        return ans;\n    }\n}\n```
['Java']