Count the Number of Substrings With Dominant Ones - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
3234. Count the Number of Substrings With Dominant Ones
Medium
30 Points
String
Sliding Window
Enumeration
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.
Examples
Example 1
Input: s = "00011"
Output: 5
Explanation:
The substrings with dominant ones are shown in the table below.
Example 2
Input: s = "101101"
Output: 16
Explanation:
The substrings with non-dominant ones are shown in the table below.
Since there are 21 substrings total and 5 of them have non-dominant ones, it follows that there are 16 substrings with dominant ones.
Constraints
1 <= s.length <= 4 * 104
s consists only of characters '0' and '1'.
3234. Count the Number of Substrings With Dominant Ones
Medium
30 Points
String
Sliding Window
Enumeration
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.
Examples
Example 1
Input: s = "00011"
Output: 5
Explanation:
The substrings with dominant ones are shown in the table below.
Example 2
Input: s = "101101"
Output: 16
Explanation:
The substrings with non-dominant ones are shown in the table below.
Since there are 21 substrings total and 5 of them have non-dominant ones, it follows that there are 16 substrings with dominant ones.