You are given an integer array nums of length n.

A partition is formed by splitting nums into two non empty contiguous subarrays: a left subarray consisting of elements from index $0$ to index i, and a right subarray consisting of elements from index i + 1 to index n - 1, where $0 \leq i < n - 1$.

Return the number of partitions where the difference between the sum of elements in the left subarray and the sum of elements in the right subarray is even.

Constraints:

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

• $1 \leq$ nums[i] $\leq 100$

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.