Leetcode 1664. Ways to Make a Fair Array

Count how many indices you can remove from nums so that the remaining array has equal sums at even and odd indices. The core challenge is handling the parity shift after deletion efficiently by using prefix/suffix sums of even- and odd-indexed values (n up to 1e5).