// Changing the minimum or maximum values will only minimize the score is the key to solving it
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```java []\nclass Solution\n{\n    public int minimizeSum(int[] nums)\n    {\n        Arrays.sort(nums);\n        return Math.min(Math.min(nums[nums.length-1]-nums[2],nums[nums.length-3]-nums[0]),nums[nums.length-2] - nums[1]);\n    }\n}\n```
['Math', 'Java']