Easy & simple
Code


# Code
```python3 []
class Solution:
    def minimumPairRemoval(self, nums: List[int]) -> int:
        def check(n):
            prefix = []
            for i in range(len(n) - 1):
                prefix.append(n[i] + n[i + 1])
            mini = min(prefix)
            idx = prefix.index(mini)
            new_nums = n[:idx] + [n[idx] + n[idx + 1]] + n[idx + 2:]
            return new_nums
    
        count = 0
        while any(nums[i] > nums[i + 1] for i in range(len(nums) - 1)):
            nums = check(nums)
            count += 1
        return count
```
['Python3']