Java || 100% beats || 2 solutions || ❤️❤️
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:0(N)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:0(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 (String i : words)\n            if (s.startsWith(i)) count++;\n        return count;\n\n\n//                          Another solution\n\n        // int count = 0;\n        // int low = 0;\n        // for(int i=1; i<=s.length(); i++){\n        //    for(int j=0; j<words.length; j++){\n        //        if(words[j].equals(s.substring(low,i))){\n        //           count++;\n        //        } \n        //    }\n        // }\n        // return count;\n    } \n}\n```
['String', 'String Matching', 'Java']