You are given an array nums consisting of positive integers.

In one operation, you can select any two adjacent elements in the array and replace them with a single element equal to their sum.

Return the minimum number of operations required to make nums a palindrome.

Constraints:

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

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

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.