1967. Number of Strings That Appear as Substrings in Word

class Solution {
    public int numOfStrings(String[] patterns, String word) {
        int count = 0;

        for (String pattern : patterns) {
            if (word.contains(pattern)) {
                count++;
            }
        }

        return count;
    }
}

class Solution:
    def numOfStrings(self, patterns: List[str], word: str) -> int:
        count = 0

        for pattern in patterns:
            if pattern in word:
                count += 1

        return count

class Solution {
public:
    int numOfStrings(vector<string>& patterns, string word) {

        int count = 0;

        for (string& pattern : patterns) {
            if (word.find(pattern) != string::npos) {
                count++;
            }
        }

        return count;
    }
};

/**
 * @param {string[]} patterns
 * @param {string} word
 * @return {number}
 */
var numOfStrings = function(patterns, word) {

    let count = 0;

    for (const pattern of patterns) {
        if (word.includes(pattern)) {
            count++;
        }
    }

    return count;
};