Given an integer array weight of size n, representing the weights of parcels placed in a row.

A shipment is defined as a contiguous subarray of parcels. A shipment is considered balanced if the weight of its last parcel is strictly less than the maximum parcel weight within that shipment.

Return the maximum number of disjoint balanced shipments that can be formed from weight.

Constraints:

• $2 \leq$ n $\leq 10^5$

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

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.