9_jan

/*
ou are given an array of strings words and a string pref.

Return the number of strings in words that contain pref as a prefix.

A prefix of a string s is any leading contiguous substring of s.

 

Example 1:

Input: words = ["pay","attention","practice","attend"], pref = "at"
Output: 2
Explanation: The 2 strings that contain "at" as a prefix are: "attention" and "attend".
*/

//approch
class Solution {
public:
    int prefixCount(vector<string>& words, string pref) {
        int n = words.size();
        int len = pref.length();
        int cnt = 0;

        for(int i = 0 ; i < n ; i++){
            string str = words[i];
            //if(str.find(pref) == 0) cnt++;
            if(str.substr(0,len) == pref) cnt++;
        }
        return cnt;
        
    }
};