You are given an integer array nums.

You start at index $0$ and want to reach index nums.length $- 1$. From your current index i, you can jump to any index j such that i $< j$. The score obtained from jumping from index i to index j is $(j - i) imes$ nums[j].

Return the maximum total score you can achieve by jumping to the last index.

Constraints:

• $2 \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.