2255. Count Prefixes of a Given String

You are given a string array words and a string s, where words[i] and s comprise only of lowercase English letters.

Return the number of strings in words that are a prefix of s.

A prefix of a string is a substring that occurs at the beginning of the string. A substring is a contiguous sequence of characters within a string.

class Solution {
public:
    int countPrefixes(vector<string>& words, string s) {
        int res = 0;
        for(auto& w : words) {
            if(w.length() > s.length()) continue;
            bool eq = true;
            for(int i = 0; i < w.length() and eq; i++) {
                if(s[i] != w[i]) eq = false;
            }
            res += eq;
        }
        return res;
    }
};