2567. Minimum Score by Changing Two Elements
IntuitionApproachComplexity
Time complexity:

Space complexity:
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```python3 []
class Solution:
    def minimizeSum(self, nums: List[int]) -> int:
        nums.sort()
        # Option 1: Change the first two elements
        option1 = nums[-1] - nums[2]
        # Option 2: Change the last two elements
        option2 = nums[-3] - nums[0]
        # Option 3: Change the first and last elements
        option3 = nums[-2] - nums[1]
        
        return min(option1, option2, option3)

```
['Python3']