Python Solution || 2 lines || Easy to understand
\nclass Solution:\n    def minimizeSum(self, nums: List[int]) -> int:\n        n,_ = len(nums),nums.sort()\n        return min([nums[n-1]-nums[0],nums[n-3]-nums
```\nclass Solution:\n    def minimizeSum(self, nums: List[int]) -> int:\n        n,_ = len(nums),nums.sort()\n        return min([nums[n-1]-nums[0],nums[n-3]-nums[0],nums[n-1]-nums[2],nums[n-2]-nums[1]])\n```
['Array', 'Math', 'Greedy', 'Sorting', 'Python', 'Python3']