add 2062

fishercoder1534 · fishercoder1534 · commit 1699b26e8e81 · 2021-11-08T07:17:33.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2062|[Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2062.java) ||Easy||
 |2058|[Find the Minimum and Maximum Number of Nodes Between Critical Points](https://leetcode.com/problems/find-the-minimum-and-maximum-number-of-nodes-between-critical-points/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2058.java) ||Medium||
 |2057|[Smallest Index With Equal Value](https://leetcode.com/problems/smallest-index-with-equal-value/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2057.java) ||Easy||
 |2055|[Plates Between Candles](https://leetcode.com/problems/plates-between-candles/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2055.java) ||Medium||
diff --git a/src/main/java/com/fishercoder/solutions/_2062.java b/src/main/java/com/fishercoder/solutions/_2062.java
@@ -0,0 +1,32 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.Set;
+
+public class _2062 {
+    public static class Solution1 {
+        public int countVowelSubstrings(String word) {
+            int count = 0;
+            Set<Character> vowels = new HashSet<>(Arrays.asList('a', 'e', 'i', 'o', 'u'));
+            Set<Character> window = new HashSet<>();
+            for (int i = 0; i < word.length(); i++) {
+                window.clear();
+                if (vowels.contains(word.charAt(i))) {
+                    window.add(word.charAt(i));
+                    for (int j = i + 1; j < word.length(); j++) {
+                        if (!vowels.contains(word.charAt(j))) {
+                            break;
+                        } else {
+                            window.add(word.charAt(j));
+                            if (window.size() == 5) {
+                                count++;
+                            }
+                        }
+                    }
+                }
+            }
+            return count;
+        }
+    }
+}
