Add solution #2053

Author: JoshCrozier

README.md

@@ -244,6 +244,7 @@
 2011|[Final Value of Variable After Performing Operations](./2011-final-value-of-variable-after-performing-operations.js)|Easy|
 2016|[Maximum Difference Between Increasing Elements](./2016-maximum-difference-between-increasing-elements.js)|Easy|
 2047|[Number of Valid Words in a Sentence](./2047-number-of-valid-words-in-a-sentence.js)|Easy|
+2053|[Kth Distinct String in an Array](./2053-kth-distinct-string-in-an-array.js)|Medium|
 2095|[Delete the Middle Node of a Linked List](./2095-delete-the-middle-node-of-a-linked-list.js)|Medium|
 2114|[Maximum Number of Words Found in Sentences](./2114-maximum-number-of-words-found-in-sentences.js)|Easy|
 

solutions/2053-kth-distinct-string-in-an-array.js

@@ -0,0 +1,29 @@
+/**
+ * 2053. Kth Distinct String in an Array
+ * https://leetcode.com/problems/kth-distinct-string-in-an-array/
+ * Difficulty: Medium
+ *
+ * A distinct string is a string that is present only once in an array.
+ *
+ * Given an array of strings arr, and an integer k, return the kth distinct
+ * string present in arr. If there are fewer than k distinct strings, return
+ * an empty string "".
+ *
+ * Note that the strings are considered in the order in which they appear in
+ * the array.
+ */
+
+/**
+ * @param {string[]} arr
+ * @param {number} k
+ * @return {string}
+ */
+var kthDistinct = function(arr, k) {
+  const map = new Map();
+  arr.forEach(n => map.set(n, (map.get(n) || 0) + 1));
+
+  const sorted = [...map].sort(([,a], [,b]) => a - b);
+  const [kth, count] = sorted[k - 1] || [];
+
+  return count === 1 ? kth : '';
+};