Beginner friendly [Java/JavaScript/Python] Solution
Time Complexity : O(n*m)\nJava\n\nclass Solution {\n    public int prefixCount(String[] words, String pref) {\n        int count = 0;\n        for(String word :
**Time Complexity : O(n*m)**\n**Java**\n```\nclass Solution {\n    public int prefixCount(String[] words, String pref) {\n        int count = 0;\n        for(String word : words){\n            if(word.indexOf(pref) == 0) count++;   \n        }\n        return count;\n    }\n}\n```\n**JavaScript**\n```\nvar prefixCount = function(words, pref) {\n    let count = 0;\n    for(let word of words){\n        if(word.indexOf(pref) == 0) count++;\n    }\n    return count;\n};\n```\n**Python**\n```\nclass Solution(object):\n    def prefixCount(self, words, pref):\n        count = 0\n        for word in words:\n            if pref in word and word.index(pref) == 0:\n                count += 1\n        return count\n```
['Python', 'Java', 'JavaScript']