Java Solution|| Beats 100%💯 || 3 line code🔥
\n# Approach\n Describe your approach to solving the problem. \n- The startsWith method returns true if the string it is called on starts with the provided pref
\n# Approach\n<!-- Describe your approach to solving the problem. -->\n- The startsWith method returns true if the string it is called on starts with the provided prefix (string s), otherwise it returns false.\n\n# Complexity\n- Time complexity:$$O(n)$$\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:$$O(1)$$\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int countPrefixes(String[] words, String s) {\n        int count=0;\n        for(int i=0;i<words.length;i++){\n            if(s.startsWith(words[i])){\n                count++;\n            }\n        }\n        return count;\n    }\n}\n```
['Array', 'String', 'Java']