solves kth distinct string in array

Author: anishLearnsToCode

README.md

@@ -488,7 +488,7 @@
 | 2037 | [Minimum Number of Moves to Seat Everyone](https://leetcode.com/problems/minimum-number-of-moves-to-seat-everyone)                                        |                                                       [![Java](assets/java.png)](src/MinimumNumberOfMovesToSeatEveryone.java)                                                        |                                                                                                                                   |
 | 2042 | [Check if Numbers Are Ascending in a Sentence](https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence)                                |                                                      [![Java](assets/java.png)](src/CheckIfNumbersAreAscendingInASentence.java)                                                      |                                                                                                                                   |
 | 2047 | [Number of Valid Words in a Sentence](https://leetcode.com/problems/number-of-valid-words-in-a-sentence)                                                  |                                                          [![Java](assets/java.png)](src/NumberOfValidWordsInASentence.java)                                                          |                                                                                                                                   |
-| 2053 | [Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array)                                                          |                                                                                                                                                                                      |                                                                                                                                   |
+| 2053 | [Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array)                                                          |                                                           [![Java](assets/java.png)](src/KthDistinctStringInAnArray.java)                                                            |                                                                                                                                   |
 | 2057 | [Smallest Index With Equal Value](https://leetcode.com/problems/smallest-index-with-equal-value)                                                          |                                                                                                                                                                                      |                                                                                                                                   |
 | 2062 | [Count Vowel Substrings of a String](https://leetcode.com/problems/count-vowel-substrings-of-a-string)                                                    |                                                                                                                                                                                      |                                                                                                                                   |
 | 2068 | [Check Whether Two Strings are Almost Equivalent](https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent)                          |                                                                                                                                                                                      |                                                                                                                                   |

src/KthDistinctStringInAnArray.java

@@ -0,0 +1,27 @@
+// https://leetcode.com/problems/kth-distinct-string-in-an-array
+// T: O(|arr|)
+// S: O(|arr|)
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class KthDistinctStringInAnArray {
+    public String kthDistinct(String[] arr, int k) {
+        final Map<String, Integer> frequencies = getFrequency(arr);
+        for (String s : arr) {
+            if (frequencies.get(s) == 1) {
+                k--;
+            }
+            if (k == 0) return s;
+        }
+        return "";
+    }
+
+    private Map<String, Integer> getFrequency(String[] array) {
+        final Map<String, Integer> frequencies = new HashMap<>();
+        for (String s : array) {
+            frequencies.put(s, frequencies.getOrDefault(s, 0) + 1);
+        }
+        return frequencies;
+    }
+}