Easy taking all cases possible
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 {\npublic:\n    int minimizeSum(vector<int>& nums) {\n        sort(nums.begin(),nums.end());\n        int ans=abs(nums[0]-nums.back());\n        //left 2\n        ans=(ans,abs(nums.back()-nums[2]));\n        //right 2\n        ans=min(ans,abs(nums[0]-nums[nums.size()-3]));\n        //one left one right\n        ans=min(ans,abs(nums[1]-nums[nums.size()-2]));\n        return ans;\n    }   \n};\n```
['C++']