scala solution
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
```scala []
object Solution {
  def minimumPairRemoval(nums: Array[Int]): Int = {
    @annotation.tailrec
    def f(nums: Array[Int], ops: Int): Int = {
      if (nums.sorted.sameElements(nums)) ops
      else {
        val idx = nums.sliding(2).map(_.sum).zipWithIndex.minBy(_._1)._2
        val newNums = nums.take(idx) ++ Array(nums(idx) + nums(idx + 1)) ++ nums.drop(idx + 2)
        f(newNums, ops + 1)
      }
    }
    f(nums, 0)
  }
}
```
['Scala']