Python 3   ||   2 lines,  w/  explanation  ||   T/S: 72% / 81%
\nclass Solution:\n    def minimizeSum(self, nums: List[int]) -> int:\n\n        nums.sort()\n\n        return min(nums[-1] - nums[2],  #  [a,b,c, ..., x,y,z] =
```\nclass Solution:\n    def minimizeSum(self, nums: List[int]) -> int:\n\n        nums.sort()\n\n        return min(nums[-1] - nums[2],  #  [a,b,c, ..., x,y,z] => [c,c,c, ..., x,y,z]\n                   nums[-2] - nums[1],  #  [a,b,c, ..., x,y,z] => [b,b,c, ..., x,y,y] \n                   nums[-3] - nums[0])  #  [a,b,c, ..., x,y,z] => [a,b,c, ..., x,x,x]\n\n                                        #  Return  min((z-c)+(c-c), (x-a)+(x-x), (y-b)+(b-b))\n```\n[https://leetcode.com/problems/minimum-score-by-changing-two-elements/submissions/1296008208/](https://leetcode.com/problems/minimum-score-by-changing-two-elements/submissions/1296008208/)\n\nI could be wrong, but I think that time complexity is *O*(*N* log *N*) and space complexity is *O*(1).\n
['Python3']