Leetcode 2062. Count Vowel Substrings of a String

Count the number of contiguous substrings that consist only of vowels and contain all five vowels (a, e, i, o, u) at least once. The core challenge is to identify vowel-only segments and count how many of their substrings include every distinct vowel.