LeetCode 2062: Count Vowel Substrings of a String Solution

Master LeetCode problem 2062 (Count Vowel Substrings of a String), a easy 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.

2062. Count Vowel Substrings of a String

Easy

Hash Table String

Problem Explanation

Explanation

To solve this problem, we can iterate through the input string and check for every possible substring that fulfills the conditions of having all vowels present. We can do this by keeping track of the count of each vowel in the current substring and incrementing the count of valid substrings accordingly.

Initialize a variable to store the count of valid vowel substrings.
Iterate through the input string using a sliding window approach.
For each character in the string, check if it is a vowel.
If it is a vowel, increment the count of that vowel in the current substring.
If all five vowels are present in the current substring, increment the count of valid vowel substrings.
Move the start of the window one position to the right and update the count of vowels accordingly.
Repeat steps 3-6 until the end of the string is reached.

Time Complexity: O(N), where N is the length of the input string. Space Complexity: O(1)

Solution Code

class Solution {
    public int countVowelSubstrings(String word) {
        int count = 0;
        int[] vowelsCount = new int[5];
        int start = 0;
        
        for (int end = 0; end < word.length(); end++) {
            char ch = word.charAt(end);
            if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') {
                vowelsCount[ch - 'a']++;
            }
            
            if (vowelsCount[0] > 0 && vowelsCount[1] > 0 && vowelsCount[2] > 0 && vowelsCount[3] > 0 && vowelsCount[4] > 0) {
                count += word.length() - end;
                
                while (start <= end && vowelsCount[word.charAt(start) - 'a'] > 1) {
                    vowelsCount[word.charAt(start) - 'a']--;
                    start++;
                    count++;
                }
            }
        }
        
        return count;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2062 (Count Vowel Substrings of a String)?

This page provides optimized solutions for LeetCode problem 2062 (Count Vowel Substrings of a String) 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 2062 (Count Vowel Substrings of a String)?

The time complexity for LeetCode 2062 (Count Vowel Substrings of a String) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2062 on DevExCode?

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

Back to LeetCode Solutions