Java, 100% Faster, 4ms
\nclass Solution {\n    public int countConsistentStrings(String allowed, String[] words) {        \n        int [] alpha = new int[26];\n        \n        for 
```\nclass Solution {\n    public int countConsistentStrings(String allowed, String[] words) {        \n        int [] alpha = new int[26];\n        \n        for (int i=0; i < allowed.length(); i++)\n        {\n            char ch = allowed.charAt(i);\n            alpha[ch-\'a\']++;\n        }\n        \n        int count = 0;\n        \n        T: for (String word : words)\n        {        \n            for (int i=0; i < word.length(); i++)\n            {\n                char ch = word.charAt(i);\n                if (alpha[ch-\'a\'] <= 0) continue T;\n            }\n            count++;\n        }\n            \n        return count;\n    }\n}\n```
['Java']