JAVA very easy solution
Approach\nSort the array in ascending order\nThree Cases can occur-\n1. Remove first two elements\n2. Remove last two elements\n3. Remove first and the last ele
### Approach\nSort the array in ascending order\nThree Cases can occur-\n1. Remove first two elements\n2. Remove last two elements\n3. Remove first and the last element\n\n\n\n# Code\n```\nclass Solution {\n    public int minimizeSum(int[] nums) {\n        Arrays.sort(nums);\n        int d1=(nums[nums.length-1]-nums[2]);\n        int d2=(nums[nums.length-1-2]-nums[0]);\n        int d3=(nums[nums.length-1-1]-nums[1]);\n        return (int)(Math.min(d1,Math.min(d2,d3)));\n    }\n}\n```
['Array', 'Greedy', 'Sorting', 'Java']