CAN'T BE MORE EASY
class Solution {\npublic:\n    int prefixCount(vector& words, string pref) {\n        \n        int n = words.size(); \n        int k = pref.length(); \n       
class Solution {\npublic:\n    int prefixCount(vector<string>& words, string pref) {\n        \n        int n = words.size(); \n        int k = pref.length(); \n        \n        int count = 0; \n        for(int i  =0; i<n; i++)\n        {\n            if(words[i].length() >= k)\n            {\n                if(words[i].substr(0,k) == pref)\n                    count++; \n            }\n        }\n        return count; \n    }\n};
[]