Fair Binary Split
Count the ways to cut the binary string into two non-empty parts so both parts contain the same number of 1s.
Input: one line with a binary string.
Output: the number of valid cut positions.
Constraints:
- 2 ≤ |S| ≤ 105
Sample Tests
Input 1
0101
Output 1
2
Input 2
111
Output 2
0
Discussion (opens after you solve — no spoilers before)
No comments yet.