FINBOX Hiring | Off-Campus OA (2023) | Count Vowel Substrings of a Word

Q1: Count Vowel Substrings of a Word Problem Statement You are given a string word. A substring is called a vowel substring if: Every character is a vowel (a, e, i, o, u). All five vowels appear at least once. Return the total number of vowel substrings. Example Input word = "cuaieuouac" Output 7 Explanation There are 7 substrings consisting only of vowels and containing all five vowels at least once. Constraints 1 <= word.length <= 100 word contains lowercase ...