Algorithm · Snowflake · Easy
Vowel-Only Substrings Easy · Topics · Company Tags · Hints You are given a string s consisting solely of lowercase English letters. Count the total number of substrings that are formed exclusively from vowel characters. The vowels are 'a', 'e', 'i', 'o', and 'u'. A substring is any contiguous block of characters inside s. For example, if s = "abc", its substrings include "a", "b", "c", "ab", "bc", and "abc". Return the count of those substrings that contain only vowels.…
Checking your access…