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

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

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

|2047|[Number of Valid Words in a Sentence](https://leetcode.com/problems/number-of-valid-words-in-a-sentence/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2047.java)||Easy||

packagecom.fishercoder.solutions;

importjava.util.HashMap;

importjava.util.Map;

publicclass_2053 {

publicstaticclassSolution1 {

publicStringkthDistinct(String[]arr,intk) {

Map<String,Integer>map =newHashMap<>();

for (Strings :arr) {

map.put(s,map.getOrDefault(s,0) +1);

}

intcount =0;

for (Strings :arr) {

if (map.get(s) ==1) {

count++;

if (k ==count) {

returns;

}

}

}

return"";

}

}

}