3234. Count the Number of Substrings With Dominant Ones

You are given a binary string s. Return the number of substrings with dominant ones. A string has dominant ones if the number of ones in the string is greater than or equal to the square of the number of zeros in the string. Example 1: Input: s = "00011" Output: 5 Explanation: The substrings with dominant ones are shown in the table below. i j s[i..j] Number of Zeros Number of Ones