You are given an integer array nums.

In one operation, you perform the following steps:

• Locate the pair of adjacent elements with the minimum sum. If multiple adjacent pairs share the same minimum sum, choose the leftmost pair.

• Replace the two elements in that pair with a single element equal to their sum.

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

Constraints:

• $1 \leq$ nums.length $\leq 50$

• $-1000 \leq$ nums[i] $\leq 1000$

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.