Learn AI Create the Future — with Pranay
Main site

LeetCode solutions

3773. Minimum Pair Removal to Sort Array I

My accepted Python solution to LeetCode problem 3773, Minimum Pair Removal to Sort Array I, running in 15ms.

  • Difficulty: Easy
  • Python
  • Runtime 15ms
  • Memory 17.5MB

Read the problem on LeetCode View on GitHub

The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.

Python

Accepted on LeetCode — runtime 15ms, memory 17.5MB, accepted 2025-12-30.

python
class Solution:
    def minimumPairRemoval(self, nums: List[int]) -> int:
        ops = 0
        while True:
            if all(nums[i] <= nums[i+1] for i in range(len(nums)-1)):
                return ops
            min_idx = 0
            for i in range(len(nums)-1):
                if nums[i] + nums[i+1] < nums[min_idx] + nums[min_idx+1]:
                    min_idx = i
            nums[min_idx] = nums[min_idx] + nums[min_idx+1]
            nums.pop(min_idx+1)
            ops += 1

Source