Given an array of integers nums, you can perform any of the following actions in a single operation if nums contains at least $2$ elements:

• Delete the first two elements of nums, with a score equal to their sum.

• Delete the last two elements of nums, with a score equal to their sum.

• Delete the first element and the last element of nums, with a score equal to their sum.

The score of each operation must be identical for all performed operations.

Return the maximum number of operations that can be performed such that all operations have the same score.

Constraints:

• $2 \leq$ nums.length $\leq 2000$

• $1 \leq$ nums[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.