You are given an integer array nums.

In one operation, you perform the following steps:

1. Find an adjacent pair of elements in nums with the minimum sum. If there are multiple such adjacent pairs, choose the leftmost one.

2. Replace the two chosen elements with a single element equal to their sum.

Repeat this operation until nums is sorted in nondecreasing order.

Return the total number of operations required to make nums sorted in nondecreasing order.

Constraints:

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

• $-10^9 \leq$ nums[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.