Zero-Sum Subarrays — Solution & Editorial

Back to the Problem

A subarray (l, r] sums to zero iff prefix[r] = prefix[l]. Count equal prefix values with a hash map, adding C(k, 2) pairs incrementally.

Complexity: O(N)

Watch out: Remember the empty prefix (value 0) — it pairs with every later prefix summing to 0.