Leetcode 2856. Minimum Array Length After Pair Removals

Given a sorted array, repeatedly remove any pair of elements (i, j) with nums[i] < nums[j]; return the minimum possible length after performing removals. This is a pairing/greedy matching problem on a sorted sequence: maximize the number of valid smaller-larger pairs to minimize the leftover elements.