hardArrayDoubly Linked ListHash TableHeap Priority QueueLinked ListOrdered SetSimulation 0 views

Minimum Pair Removal to Sort Array II

Given an array nums, you can perform the following operation any number of times: Return the minimum number of operations needed to make the array non-decreasing.

Given an array nums, you can perform the following operation any number of times:

Return the minimum number of operations needed to make the array non-decreasing.

An array is said to be non-decreasing if each element is greater than or equal to its previous element (if it exists).

Minimum Pair Removal to Sort Array II diagram

Example 1

Input: nums = [5,2,3,1]

Output: 2

Explanation: The array nums became non-decreasing in two operations.

Example 2

Input: nums = [1,2,2]

Output: 0

Explanation: The array nums is already sorted.

Constraints

1 <= nums.length <= 10^5
-10^9 <= nums[i] <= 10^9

Hints

Companies

No companies reported yet.

Discussion

Loading discussion...

class Solution {
    public int minimumPairRemoval(int[] nums) {
        
    }
}

Test results

No test cases yet.