 All Problems
Count Vowel Substrings of a Word
easy
strings
sliding window
hash map
amazon
google

A substring is a vowel substring if it consists only of vowels ('a', 'e', 'i', 'o', 'u') and contains all 5 vowels at least once. Given a string word, return the number of such substrings.

Example 1:

Input: aeiouu
Output: 2

Example 2:

Input: unicornarihan
Output: 0

Input format: A single lowercase string.

Output format: Count of vowel substrings.

Run to check your code against the sample cases, or submit to run every case