Fair Binary Split — Solution & Editorial

Back to the Problem

If the total count of 1s is odd, the answer is 0. Otherwise count prefixes (excluding the full string) holding exactly half of the 1s.

Complexity: O(|S|)