Problem 2750 · Medium
Count splits where every subarray has exactly one 1, using dp[i] = sum of dp[j] over valid starts j.
Open the interactive visualisation