Java Bit Manipulation Solution
\npublic int countConsistentStrings(String allowed, String[] words) {\n\tint map = 0;\n\tfor (char c : allowed.toCharArray()) {\n\t\tmap |= 1 << c - \'a\';\n\t}
```\npublic int countConsistentStrings(String allowed, String[] words) {\n\tint map = 0;\n\tfor (char c : allowed.toCharArray()) {\n\t\tmap |= 1 << c - \'a\';\n\t}\n\n\tint count = 0;\n\tfor (String word : words) {\n\t\tboolean consistent = true;\n\t\tfor (char c : word.toCharArray()) {\n\t\t\tif ((map & (1 << c - \'a\')) == 0) {\n\t\t\t\tconsistent = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tcount += consistent ? 1 : 0;\n\t}\n\n\treturn count;\n}\n```
['Bit Manipulation', 'Java']