Given an array of strings patterns and a string word, return the number of strings in patterns that exist as a substring in word.

A substring is a contiguous sequence of characters within a string.

&nbsp;
Example 1:

Input: patterns = ["a","abc","bc","d"], word = "abc"
Output: 3
Explanation:
- "a" appears as a substring in "abc".
- "abc" appears as a substring in "abc".
- "bc" appears as a substring in "abc".
- "d" does not appear as a substring in "abc".
3 of the strings in patterns appear as a substring in word.


Example 2:

Input: patterns = ["a","b","c"], word = "aaaaabbbbb"
Output: 2
Explanation:
- "a" appears as a substring in "aaaaabbbbb".
- "b" appears as a substring in "aaaaabbbbb".
- "c" does not appear as a substring in "aaaaabbbbb".
2 of the strings in patterns appear as a substring in word.


Example 3:

Input: patterns = ["a","a","a"], word = "ab"
Output: 3
Explanation: Each of the patterns appears as a substring in word "ab".


&nbsp;
Constraints:


	1 &lt;= patterns.length &lt;= 100
	1 &lt;= patterns[i].length &lt;= 100
	1 &lt;= word.length &lt;= 100
	patterns[i] and word consist of lowercase English letters.


class Solution:
    def numOfStrings(self, patterns: List[str], word: str) -> int:
        return sum([pattern in word for pattern in patterns])

        
class Solution {
    public int numOfStrings(String[] patterns, String word) {
        int count = 0;
        for(int i=0;i<patterns.length;i++){
            if(word.contains(patterns[i])){
                count++;
            }
        }
        return count;
    }
}
class Solution {
public:
    int numOfStrings(vector<string>& patterns, string word) {
        int count=0;
        for(int i=0;i<patterns.size();i++)
        {
            if(word.find(patterns[i])!=string::npos)
                count++;
        }
        return count;
    }
};
/**
 * @param {string[]} patterns
 * @param {string} word
 * @return {number}
 */
var numOfStrings = function(patterns, word) {
    let result = 0; 
    
    for(let char of patterns){
        if(word.includes(char)){
            result++;
           } else{
               result += 0;
           }
    }
    
    return result;
};
Number of Strings That Appear as Substrings in Word