JAVA || Easy Solution || 97% faster code
PLEASE UPVOTE IF YOU LIKE.\n\nclass Solution {\n    public int numMatchingSubseq(String s, String[] words) {\n        \n        Map<String,Integer> map = new Ha
PLEASE UPVOTE IF YOU LIKE.\n```\nclass Solution {\n    public int numMatchingSubseq(String s, String[] words) {\n        \n        Map<String,Integer> map = new HashMap<>();\n        for(String str:words){\n            map.put(str,map.getOrDefault(str,0)+1);\n        }\n        \n        int ans = 0;\n        char ch[] = s.toCharArray();\n        \n        for(String str:map.keySet()){\n            \n            char temp[] = str.toCharArray();\n            int i = 0;\n            int j = 0;\n            \n            while(i<ch.length && j<temp.length){\n                if(ch[i]==temp[j]){\n                    i++;\n                    j++;\n                }else{\n                    i++;\n                }\n            }\n            \n            if(j==temp.length){\n                ans+=map.get(str);\n            }\n            \n        }\n        \n      return ans;  \n    }\n}\n```
['Java']