Simple and Easy JAVA Solution , Basic maths
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 minimizeSum(int[] nums) {\n        if(nums.length == 3)\n            return 0;\n        Arrays.sort(nums);\n        int last = nums.length-1;\n        int ans = Integer.MAX_VALUE;\n        for(int i=0;i<=2;i++){\n            ans = Math.min(ans , nums[last-i] - nums[2-i]);\n        }\n        return ans;\n    }\n}\n```
['Array', 'Java']