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

Author: rain84

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

@@ -193,4 +193,36 @@ function kthDistinct(arr k) {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Hash Set
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function kthDistinct(arr: string[], k: number): string {
+    const distinct = new Set<string>();
+    const duplicate = new Set<string>();
+
+    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 -->
+
 <!-- problem:end -->

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

@@ -194,4 +194,36 @@ function kthDistinct(arr k) {
 
 <!-- solution:end -->
 
+<!-- solution:start -->
+
+### Solution 2: Hash Set
+
+<!-- tabs:start -->
+
+#### TypeScript
+
+```ts
+function kthDistinct(arr: string[], k: number): string {
+    const distinct = new Set<string>();
+    const duplicate = new Set<string>();
+
+    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 -->
+
 <!-- problem:end -->

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

@@ -0,0 +1,17 @@
+function kthDistinct(arr: string[], k: number): string {
+    const distinct = new Set<string>();
+    const duplicate = new Set<string>();
+
+    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 '';
+}