Given a $0$-indexed integer array nums sorted in non-decreasing order.

In one operation, you can choose two indices i and j such that i < j and nums[i] < nums[j], and remove the elements at these two indices from nums. The remaining elements keep their original relative order.

Return the minimum possible length of nums after performing this operation any number of times.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^9$

• nums is sorted in non-decreasing order.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.