Count the Number of Substrings With Dominant Ones
A substring is dominant when its count of ones is at least the square of its count of zeros. Count every dominant substring.
A substring is dominant when its count of ones is at least the square of its count of zeros. Count every dominant substring.