Given an integer array nums, partition it into two contiguous subarrays, left and right, such that:

• Every element in left is less than or equal to every element in right.

• left and right are non empty.

• left has the smallest possible length.

Return the length of left after performing such a partition.

Constraints:

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

• $0 \leq$ nums[i] $\leq 10^6$

• There is at least one valid answer for the given input.

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.