Easy Solution in JAVA
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:\nO(s.length)\n- Space complexity:\nO(1)\n\n# Code\n```\nclass Solution {\n    public int prefixCount(String[] s, String t) {\n        int n=s.length;\n        int count=0;\n        int m=t.length();\n        for(int i=0;i<n;i++)\n        {\n            if(s[i].startsWith(t))\n                count++;\n        }\n        return count;\n    }\n}\n```
['Java']