Easy solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int countPrefixes(vector<string>& words, string s)\n    {\n        string w = "" ;\n        int count = 0 ;\n        for(int i=0 ; i<words.size() ; i++)\n        {\n            w = words[i] ;\n            int j ;\n            for(j=0 ; j<w.size() ; j++)\n            {\n                if(w[j]!=s[j])\n                {\n                    break ;\n                }\n            }\n            if(j==w.size())\n            {\n                count++ ;\n            }\n        }   \n        return count ;\n    }\n};\n```
['C++']