Given an integer array nums, consider an operation where the first $2$ elements of nums are removed and their sum is calculated as the score of the operation.

You start by performing this operation once. You can continue performing operations as long as nums contains at least $2$ elements and each subsequent operation yields the exact same score as the first operation.

Return the maximum number of operations that can be performed.

Constraints:

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

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