| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|2063|[Vowels of All Substrings](https://leetcode.com/problems/vowels-of-all-substrings/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2063.java)||Medium||

|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||

packagecom.fishercoder.solutions;

publicclass_2063 {

publicstaticclassSolution1 {

publiclongcountVowels(Stringword) {

longans =0;

for (inti =0;i <word.length();i++) {

if (isVowel(word.charAt(i))) {

longleft =i;

longright =word.length() -left -1;

ans += (left +1) * (right +1);

}

}

returnans;

}

privatebooleanisVowel(charch) {

returnch =='a' ||ch =='e' ||ch =='i' ||ch =='o' ||ch =='u';

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._2063;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_2063Test {

privatestatic_2063.Solution1solution1;

privatestaticStringword;

privatestaticlongexpected;

publicstaticvoidsetup() {

solution1 =new_2063.Solution1();

}

publicvoidtest1() {

word ="aba";

expected =6l;

assertEquals(expected,solution1.countVowels(word));

}

}