Python || Easy to Understand || Simple Approach || Readability || 
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 minimumPairRemoval(self, nums: List[int]) -> int:

        operations=0
        while(self.is_sorted(nums)==False):
            self.reduce_minimum_pair(nums)
            operations+=1

        return operations


    def is_sorted(self,nums):
        return nums==sorted(nums)

    def reduce_minimum_pair(self,nums):    
    
        mini=float('inf')
        index=0
        for i in range(1,len(nums)):
            if nums[i]+nums[i-1]<mini:
                mini=nums[i]+nums[i-1]
                index=i-1
        
        combined = nums[index] + nums[index+1]
        nums[index:index+2] = [combined]

        
        
```
['Python3']