Esay Java 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 {\n    public int countPrefixes(String[] words, String s) {\n        int c=0;\n        while(s.length()!=0){\n        for(String y:words){\n             if(y.equals(s))\n             c++;\n        }\n        s=s.substring(0,s.length()-1); //Decreasing the length by 1\n        }\n        return c;\n    }\n}\n```
['Java']