Easy Solution || Bruteforce
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
```java []
class Solution {
    public int minimumPairRemoval(int[] nums) {
        int k=0;
 List<Integer> li = Arrays.stream(nums).boxed().collect(Collectors.toList());
        while(!isSorted(li))
        {
            k++;
            int minId=-1;
            int sum=0;
            int min=Integer.MAX_VALUE;
            for(int i=0;i<li.size()-1;i++)
            {
                sum=li.get(i)+li.get(i+1);
                if(sum<min)
                {
                    min=sum;
                    minId=i;
                }
                
            }
              li.remove(minId);
                li.remove(minId);
                li.add(minId,min);
System.out.println("Step " + k + ": " + li);



        }



return k;

    }
    public boolean isSorted(List<Integer>li)
    {
        int n=li.size();
        for(int i=1;i<n;i++)
        {
            if(li.get(i-1)>li.get(i))
            return false;
        }
        return true;
        
    }
}
```
['Java']