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

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

|2055|[Plates Between Candles](https://leetcode.com/problems/plates-between-candles/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2055.java)||Medium||

|2053|[Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2053.java)||Easy||

|2050|[Parallel Courses III](https://leetcode.com/problems/parallel-courses-iii/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2050.java)||Hard||

|2048|[Next Greater Numerically Balanced Number](https://leetcode.com/problems/next-greater-numerically-balanced-number/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2048.java)||Medium||

packagecom.fishercoder.solutions;

importjava.util.TreeMap;

publicclass_2055 {

publicstaticclassSolution1 {

publicint[]platesBetweenCandles(Strings,int[][]queries) {

int[]ans =newint[queries.length];

TreeMap<Integer,Integer>treeMap =newTreeMap<>();

intleft =0;

intright =0;

while (left <s.length() &&s.charAt(left) !='|') {

left++;

}

treeMap.put(left,0);

intcount =0;

while (left <s.length()) {

if (s.charAt(left) =='|') {

right =left +1;

while (right <s.length() &&s.charAt(right) !='|') {

count++;

right++;

}

if (right <s.length()) {

treeMap.put(right,count);

}

left =right;

}else {

left++;

}

}

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

intl =queries[i][0];

intr =queries[i][1];

Integerstart =treeMap.ceilingKey(l);

Integerend =treeMap.floorKey(r);

if (start ==null ||end ==null ||start >=end) {

continue;

}

ans[i] =treeMap.get(end) -treeMap.get(start);

}

returnans;

}

}

}