Vowel Substring

Problem Overview

• Given a lowercase string, count contiguous substrings made only of vowels where a, e, i, o, u each appear at least once.
• Input: string s with ascii[a–z], 1 ≤ |s| ≤ 1e5; Output: integer count of valid substrings.
• Domain: string processing and text analytics on character sequences.
• This Snowflake interviews coding interview problem is an interview question focused on substring validation and vowel coverage.