Solution (leetcode-in-java 1.19 API)

java.lang.Object
- g2001_2100.s2062_count_vowel_substrings_of_a_string.Solution

```
public class Solution
extends Object
```
2062 - Count Vowel Substrings of a String.
Easy

A substring is a contiguous (non-empty) sequence of characters within a string.

A vowel substring is a substring that only consists of vowels ('a', 'e', 'i', 'o', and 'u') and has all five vowels present in it.

Given a string word, return the number of vowel substrings in word.

Example 1:

Input: word = “aeiouu”

Output: 2

Explanation: The vowel substrings of word are as follows (underlined):
- “aeiouu”
- “aeiouu”
Example 2:

Input: word = “unicornarihan”

Output: 0

Explanation: Not all 5 vowels are present, so there are no vowel substrings.

Example 3:

Input: word = “cuaieuouac”

Output: 7

Explanation: The vowel substrings of word are as follows (underlined):
- “cuaieuouac”
- “cuaieuouac”
- “cuaieuouac”
- “cuaieuouac”
- “cuaieuouac”
- “cuaieuouac”
- “cuaieuouac”
Constraints:
- 1 <= word.length <= 100
- word consists of lowercase English letters only.

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  int countVowelSubstrings(String word)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

countVowelSubstrings

public int countVowelSubstrings(String word)