feat: add typescript solution to lc problem: No.1967.Number of Strings That Appear as Substrings in Word

Author: zhaocchen

Diff for: solution/1900-1999/1967.Number of Strings That Appear as Substrings in Word/README.md

@@ -90,6 +90,20 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numOfStrings(patterns: string[], word: string): number {
+    let ans = 0;
+    for (let pattern of patterns) {
+        if (word.includes(pattern)) {
+            ans++;
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

Diff for: solution/1900-1999/1967.Number of Strings That Appear as Substrings in Word/README_EN.md

@@ -80,6 +80,20 @@ class Solution {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numOfStrings(patterns: string[], word: string): number {
+    let ans = 0;
+    for (let pattern of patterns) {
+        if (word.includes(pattern)) {
+            ans++;
+        }
+    }
+    return ans;
+};
+```
+
 ### **C++**
 
 ```cpp

Diff for: solution/1900-1999/1967.Number of Strings That Appear as Substrings in Word/Solution.ts

@@ -0,0 +1,9 @@
+function numOfStrings(patterns: string[], word: string): number {
+    let ans = 0;
+    for (let pattern of patterns) {
+        if (word.includes(pattern)) {
+            ans++;
+        }
+    }
+    return ans;
+};