feat: add ts solution to lc problem: No.2506 (#1297)

Author: thinkasany

solution/2500-2599/2506.Count Pairs Of Similar Strings/README.md

@@ -170,6 +170,24 @@ impl Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function similarPairs(words: string[]): number {
+    let ans = 0;
+    const cnt: Map<number, number> = new Map();
+    for (const w of words) {
+        let v = 0;
+        for (let i = 0; i < w.length; ++i) {
+            v |= 1 << (w.charCodeAt(i) - 'a'.charCodeAt(0));
+        }
+        ans += cnt.get(v) || 0;
+        cnt.set(v, (cnt.get(v) || 0) + 1);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2506.Count Pairs Of Similar Strings/README_EN.md

@@ -155,6 +155,24 @@ impl Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function similarPairs(words: string[]): number {
+    let ans = 0;
+    const cnt: Map<number, number> = new Map();
+    for (const w of words) {
+        let v = 0;
+        for (let i = 0; i < w.length; ++i) {
+            v |= 1 << (w.charCodeAt(i) - 'a'.charCodeAt(0));
+        }
+        ans += cnt.get(v) || 0;
+        cnt.set(v, (cnt.get(v) || 0) + 1);
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/2500-2599/2506.Count Pairs Of Similar Strings/Solution.ts

@@ -0,0 +1,13 @@
+function similarPairs(words: string[]): number {
+    let ans = 0;
+    const cnt: Map<number, number> = new Map();
+    for (const w of words) {
+        let v = 0;
+        for (let i = 0; i < w.length; ++i) {
+            v |= 1 << (w.charCodeAt(i) - 'a'.charCodeAt(0));
+        }
+        ans += cnt.get(v) || 0;
+        cnt.set(v, (cnt.get(v) || 0) + 1);
+    }
+    return ans;
+}