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

No.2423.Remove Letter To Equalize Frequency

Author: YangFong

solution/2400-2499/2423.Remove Letter To Equalize Frequency/README.md

@@ -153,7 +153,26 @@ func equalFrequency(word string) bool {
 ### **TypeScript**
 
 ```ts
-
+function equalFrequency(word: string): boolean {
+    const map = new Map();
+    for (const c of word) {
+        map.set(c, (map.get(c) ?? 0) + 1);
+    }
+    const count = new Map();
+    for (const v of map.values()) {
+        count.set(v, (count.get(v) ?? 0) + 1);
+    }
+    if (count.size === 1) {
+        return map.size == 1 || [...count.keys()][0] === 1;
+    }
+    if (count.size === 2) {
+        return [...count.entries()].some(
+            (v, i, arr) =>
+                (v[0] === 1 || v[0] - arr[i ^ 1][0] === 1) && v[1] === 1,
+        );
+    }
+    return false;
+}
 ```
 
 ### **...**

solution/2400-2499/2423.Remove Letter To Equalize Frequency/README_EN.md

@@ -139,7 +139,26 @@ func equalFrequency(word string) bool {
 ### **TypeScript**
 
 ```ts
-
+function equalFrequency(word: string): boolean {
+    const map = new Map();
+    for (const c of word) {
+        map.set(c, (map.get(c) ?? 0) + 1);
+    }
+    const count = new Map();
+    for (const v of map.values()) {
+        count.set(v, (count.get(v) ?? 0) + 1);
+    }
+    if (count.size === 1) {
+        return map.size == 1 || [...count.keys()][0] === 1;
+    }
+    if (count.size === 2) {
+        return [...count.entries()].some(
+            (v, i, arr) =>
+                (v[0] === 1 || v[0] - arr[i ^ 1][0] === 1) && v[1] === 1,
+        );
+    }
+    return false;
+}
 ```
 
 ### **...**

solution/2400-2499/2423.Remove Letter To Equalize Frequency/Solution.ts

@@ -0,0 +1,20 @@
+function equalFrequency(word: string): boolean {
+    const map = new Map();
+    for (const c of word) {
+        map.set(c, (map.get(c) ?? 0) + 1);
+    }
+    const count = new Map();
+    for (const v of map.values()) {
+        count.set(v, (count.get(v) ?? 0) + 1);
+    }
+    if (count.size === 1) {
+        return map.size == 1 || [...count.keys()][0] === 1;
+    }
+    if (count.size === 2) {
+        return [...count.entries()].some(
+            (v, i, arr) =>
+                (v[0] === 1 || v[0] - arr[i ^ 1][0] === 1) && v[1] === 1,
+        );
+    }
+    return false;
+}