You are given an integer array nums.

A split at index i (where $0 \leq i <$ nums.length $- 1$) divides the array into two parts:

• left consisting of elements from index $0$ to i

• right consisting of elements from index i + 1 to nums.length $- 1$

A split is considered valid if:

• left is strictly increasing

• right is strictly decreasing

Return the minimum absolute difference between the sum of elements in left and the sum of elements in right among all valid splits. If no valid split exists, return $-1$.

Constraints:

• $2 \leq$ nums.length $\leq 10^5$

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