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

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

|2070|[Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2068.java)||Easy||

|2068|[Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2068.java)||Easy||

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

packagecom.fishercoder.solutions;

importjava.util.Arrays;

publicclass_2070 {

publicstaticclassSolution1 {

publicint[]maximumBeauty(int[][]items,int[]queries) {

intlen =queries.length;

Arrays.sort(items, (a,b) ->Integer.compare(a[0],b[0]));

int[][]queryPairs =newint[len][2];

for (inti =0;i <len;i++) {

queryPairs[i] =newint[]{queries[i],i};

}

Arrays.sort(queryPairs, (a,b) ->Integer.compare(a[0],b[0]));

int[]ans =newint[len];

intj =0;

intmax =0;

for (inti =0;i <len;i++) {

int[]queryPair =queryPairs[i];

intprice =queryPair[0];

intindex =queryPair[1];

while (j <items.length &&items[j][0] <=price) {

max =Math.max(max,items[j][1]);

j++;

}

ans[index] =max;

}

returnans;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.common.utils.CommonUtils;

importcom.fishercoder.solutions._2070;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertArrayEquals;

publicclass_2070Test {

privatestatic_2070.Solution1solution1;

privatestaticint[][]items;

privatestaticint[]queries;

privatestaticint[]expected;

publicstaticvoidsetup() {

solution1 =new_2070.Solution1();

}

publicvoidtest1() {

items =CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,2],[3,2],[2,4],[5,6],[3,5]");

queries =newint[]{1,2,3,4,5,6};

expected =newint[]{2,4,5,5,6,6};

assertArrayEquals(expected,solution1.maximumBeauty(items,queries));

}

publicvoidtest2() {

items =CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[1,2],[1,2],[1,3],[1,4]");

queries =newint[]{1};

expected =newint[]{4};

assertArrayEquals(expected,solution1.maximumBeauty(items,queries));

}

publicvoidtest3() {

items =CommonUtils.convertLeetCodeIrregularLengths2DArrayInputIntoJavaArray("[10,1000]");

queries =newint[]{5};

expected =newint[]{0};

assertArrayEquals(expected,solution1.maximumBeauty(items,queries));

}

}