Python. Easy code, using sorting
\n# Approach\n We are trying to minimize the difference between elements, so we are checking the edges of the sorted array. \n\n\n# Code\n\nclass Solution:\n   
\n# Approach\n We are trying to minimize the difference between elements, so we are checking the edges of the sorted array. \n\n\n# Code\n```\nclass Solution:\n    def minimizeSum(self, nums: List[int]) -> int:\n        nums = sorted(nums)\n        return min(nums[-1]-nums[2], nums[-3]-nums[0], nums[-2]-nums[1])\n```
['Python3']