LeetCode 3234: Count the Number of Substrings With Dominant Ones Solution

Master LeetCode problem 3234 (Count the Number of Substrings With Dominant Ones), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

3234. Count the Number of Substrings With Dominant Ones

Medium

String Sliding Window Enumeration

Problem Explanation

Explanation

To solve this problem, we can iterate through all substrings of the given binary string s and count the number of zeros and ones in each substring. If the number of ones is greater than or equal to the square of the number of zeros in a substring, we increment the count of substrings with dominant ones.

We can optimize this process by maintaining a running count of zeros and ones as we iterate through the string to avoid recalculating the count for each substring.

Algorithm:

Initialize a variable count to keep track of the number of substrings with dominant ones.
Iterate through all substrings of s.
For each substring, calculate the number of zeros and ones.
If the number of ones is greater than or equal to the square of the number of zeros, increment count.
Return the final count.

Time Complexity: O(n^2) where n is the length of the input string s. Space Complexity: O(1)

Solution Code

class Solution {
    public int countSubstrings(String s) {
        int count = 0;
        for (int i = 0; i < s.length(); i++) {
            int ones = 0, zeros = 0;
            for (int j = i; j < s.length(); j++) {
                if (s.charAt(j) == '0') {
                    zeros++;
                } else {
                    ones++;
                }
                if (ones >= zeros * zeros) {
                    count++;
                }
            }
        }
        return count;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 3234 (Count the Number of Substrings With Dominant Ones)?

This page provides optimized solutions for LeetCode problem 3234 (Count the Number of Substrings With Dominant Ones) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 3234 (Count the Number of Substrings With Dominant Ones)?

The time complexity for LeetCode 3234 (Count the Number of Substrings With Dominant Ones) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 3234 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 3234 in Java, C++, or Python.

Back to LeetCode Solutions