solves number of strings that appear as substrings in word

Author: anishLearnsToCode

README.md

@@ -470,7 +470,7 @@
 | 1945 | [Sum of Digits of String After Convert](https://leetcode.com/problems/sum-of-digits-of-string-after-convert)                                              |                                                         [![Java](assets/java.png)](src/SumOfDigitsOfStringAfterConvert.java)                                                         |                                                                                                                                   |
 | 1952 | [Three Divisors](https://leetcode.com/problems/three-divisors)                                                                                            |                                                                  [![Java](assets/java.png)](src/ThreeDivisors.java)                                                                  |                                                                                                                                   |
 | 1957 | [Delete Characters to Make Fancy String](https://leetcode.com/problems/delete-characters-to-make-fancy-string)                                            |                                                          [![Java](assets/java.png)](src/CheckIfStringIsAPrefixOfArray.java)                                                          |                                                                                                                                   |
-| 1961 | [Check If String Is a Prefix of Array](https://leetcode.com/problems/check-if-string-is-a-prefix-of-array)                                                |                                                                                                                                                                                      |                                                                                                                                   |
+| 1961 | [Check If String Is a Prefix of Array](https://leetcode.com/problems/check-if-string-is-a-prefix-of-array)                                                |                                                   [![Java](assets/java.png)](src/NumberOfStringsThatAppearAsSubstringsInWord.java)                                                   |                                                                                                                                   |
 | 1967 | [Number of Strings That Appear as Substrings in Word](https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word)                  |                                                                                                                                                                                      |                                                                                                                                   |
 | 1971 | [Find if Path Exists in Graph](https://leetcode.com/problems/find-if-path-exists-in-graph)                                                                |                                                                                                                                                                                      |                                                                                                                                   |
 | 1974 | [Minimum Time to Type Word Using Special Typewriter](https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter)                    |                                                                                                                                                                                      |                                                                                                                                   |

src/NumberOfStringsThatAppearAsSubstringsInWord.java

@@ -0,0 +1,11 @@
+public class NumberOfStringsThatAppearAsSubstringsInWord {
+    public int numOfStrings(String[] patterns, String word) {
+        int substrings = 0;
+        for (String pattern : patterns) {
+            if (word.contains(pattern)) {
+                substrings++;
+            }
+        }
+        return substrings;
+    }
+}