Easy to understand, straightforward with explanation
IntuitionAfter reading the question it was clear that ordering of elements doesn't matter and we are dealing max/min diff so sorting seemed an option, also sinc
# Intuition
After reading the question it was clear that ordering of elements doesn't matter and we are dealing max/min diff so sorting seemed an option, also since we are allowed to change at most two elements so low score will always be zero as difference of equal elements is zero so we need to minimize max score only

# Approach
Sort the arrays and consider min difference of removing all the 3 combinations of elements

# Complexity
- Time complexity:
O(nlogn)

- Space complexity:
O(1)

# Code
```python3 []
class Solution:
    def minimizeSum(self, nums: List[int]) -> int:
        nums.sort()
        if len(nums)<=3:
            return 0
        else:
            n=len(nums)-1
            return min(nums[n]-nums[2],nums[n-1]-nums[1],nums[n-2]-nums[0])
        
```
['Python3']