You are given two integer arrays, nums and multipliers, of lengths n and m respectively, with elements indexed starting at $0$.

You start with an initial score of $0$ and must execute exactly $m$ operations. For each operation $i$ from $i = 0$ to $i = m - 1$:

• Pick one integer $x$ from either the beginning or the end of nums.

• Add x * multipliers[i] to your total score.

• Remove $x$ from nums.

Return the maximum total score achievable after completing all $m$ operations.

Constraints:

• n == nums.length

• m == multipliers.length

• $1 \leq$ m $\leq 300$

• m $\leq$ n $\leq 10^5$

• $-1000 \leq$ nums[i], multipliers[i] $\leq 1000$

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.