Official algorithmic problem description and constraints.
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
Example 2:
Input: s = "101101"
Output: 16
Constraints:
1 <= s.length <= 4 * 104s consists only of characters '0' and '1'.Detailed video explanations, mathematical intuition, and clean C++ implementation code.