You are given an integer array nums of size $n$.

A split is defined by choosing an index i such that $0 \leq i < n - 1$, which partitions the array into two contiguous segments:

• A prefix consisting of elements from index $0$ to index i inclusive.

• A suffix consisting of elements from index $i + 1$ to index $n - 1$ inclusive.

The score of a split at index i is calculated as the sum of the elements in the prefix minus the minimum element in the suffix:

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.