How should I practice Count Vowel Substrings of a String?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Bloomberg LP phone screen problems in FastPrep.

Is Count Vowel Substrings of a String associated with Bloomberg LP?

FastPrep tags this as a Bloomberg LP phone screen coding practice problem when the problem catalog has that company and stage context.

Count Vowel Substrings of a String

Bloomberg LP● MediumNEW GRADPHONE SCREEN

Learn

Problem statement

A vowel substring is a non-empty contiguous substring that contains only the lowercase vowels a, e, i, o, and u, and contains all five vowels at least once.

Given a lowercase English string word, return the number of vowel substrings.

Function

countVowelSubstrings(word: String) → long

Examples

Example 1

word = "aeiouu"return = 2

The valid substrings are aeiou and aeiouu.

Example 2

word = "unicornarihan"return = 0

No all-vowel substring contains every vowel.

Example 3

word = "cuaieuouac"return = 7

Seven contiguous substrings contain only vowels and include all five vowel types.

Constraints

1 <= word.length() <= 100000.
word contains only lowercase English letters.
The answer fits in a signed 64-bit integer.