You are given an integer array nums.

You start at index $0$. In each step, if you are at index $i$, you can jump to any index $j$ such that $i < j <$ nums.length. The score gained from this jump is $(j - i) imes$ nums$[i]$.

Return the maximum total score possible to reach the last index (nums.length $- 1$).

Constraints:

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

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

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.