You are given an integer array nums consisting of positive integers.

You can perform the following operation on the array any number of times:

Choose an index i such that $0 \leq$ i $<$ nums.length $- 1$ and nums[i] $\leq$ nums[i + 1]. Replace the element nums[i + 1] with nums[i] $+$ nums[i + 1] and remove nums[i] from the array.

Return the maximum value of an element that can be obtained in the array after performing any number of operations.

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.