You are given an integer array nums.

Starting at index $0$, you can jump from your current index i to any index j such that i < j. The score obtained from jumping from index i to index j is $(j - i) \times$ nums[j].

You can perform any number of jumps until you reach the last index of nums.

Return the maximum total score you can achieve.

Constraints:

• $2 \leq$ nums.length $\leq 10^3$

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