Two lines is enough
Intuition\nSince we can change two elements to any arbitrary value, we can always change them to be the same value such as the low score is always zero. \n\nNow
# Intuition\nSince we can change two elements to any arbitrary value, we can always change them to be the same value such as the low score is always zero. \n\nNow that the low score is out of the way (think of it as simply deleting two elements), we only have to try and minimize the high score to solve the problem. We use the properties of high score: max - min. To decrease this, we need to decrease max and increase min. There are three cases:\n1. we eliminate the first two elements by the method described above (increase min)\n2. we eliminate the last two elements by the method described above (decrease max)\n3. we eliminate the first and last elements by the method described above (increase min and decrease max)\n\n# Code\n```python\nclass Solution:\n    def minimizeSum(self, nums: List[int]) -> int:\n        nums.sort()\n        return min(nums[-1] - nums[2], nums[-3] - nums[0], nums[-2] - nums[1])\n```
['Greedy', 'Python3']