You are given an integer array nums.

An array is considered fair if the sum of elements at even indices is equal to the sum of elements at odd indices.

When you remove exactly one element at index i, the indices of all elements located after index i shift to the left by $1$.

Return the total number of indices i that you can remove such that the remaining array becomes fair.

Constraints:

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

• $1 \leq$ nums[i] $\leq 10^4$

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.