feat: add js solution to lc problem: No.2053

Author: rain84

solution/2000-2099/2053.Kth Distinct String in an Array/README.md

@@ -221,6 +221,28 @@ function kthDistinct(arr: string[], k: number): string {
 }
 ```
 
+#### JavaScript
+
+```js
+function kthDistinct(arr, k) {
+    const distinct = new Set();
+    const duplicate = new Set();
+
+    for (const x of arr) {
+        if (distinct.has(x)) {
+            distinct.delete(x);
+            duplicate.add(x);
+        } else if (!duplicate.has(x)) distinct.add(x);
+    }
+
+    for (const x of distinct) {
+        if (--k === 0) return x;
+    }
+
+    return '';
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2000-2099/2053.Kth Distinct String in an Array/README_EN.md

@@ -222,6 +222,28 @@ function kthDistinct(arr: string[], k: number): string {
 }
 ```
 
+#### JavaScript
+
+```js
+function kthDistinct(arr, k) {
+    const distinct = new Set();
+    const duplicate = new Set();
+
+    for (const x of arr) {
+        if (distinct.has(x)) {
+            distinct.delete(x);
+            duplicate.add(x);
+        } else if (!duplicate.has(x)) distinct.add(x);
+    }
+
+    for (const x of distinct) {
+        if (--k === 0) return x;
+    }
+
+    return '';
+}
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/2000-2099/2053.Kth Distinct String in an Array/Solution2.js

@@ -0,0 +1,17 @@
+function kthDistinct(arr, k) {
+    const distinct = new Set();
+    const duplicate = new Set();
+
+    for (const x of arr) {
+        if (distinct.has(x)) {
+            distinct.delete(x);
+            duplicate.add(x);
+        } else if (!duplicate.has(x)) distinct.add(x);
+    }
+
+    for (const x of distinct) {
+        if (--k === 0) return x;
+    }
+
+    return '';
+}