You are given a $0$ indexed integer array nums of length n.

The sum score at index i for $0 \leq i < n$ is defined as the maximum of:

• The sum of the first $i + 1$ elements of nums.

• The sum of the last $n - i$ elements of nums.

Return the maximum sum score among all possible indices from $0$ to $n - 1$.

Constraints:

• n == nums.length

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

• $-10^5 \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.