Question

Determine the number of substance that can be created where every letter is a vowel and every vowel is present atleast once c++

Answer 1

${ \huge {\boxed {\boxed {\star\: \red{Answer}\: \star}}}}$

Find substrings that contain all vowels :

We have been given a string in lowercase alphabets. We need to print substrings that contain all the vowels at-least one time and there are no consonants (non-vowel characters) present in the substrings.

Examples:

Input : str = aeoibddaeoiud

Output : aeoiu

Input : str = aeoibsddaeiouudb

Output : aeiou, aeiouu