Easy to understand. Daily question 12th September
\n\n# Code\njava []\nclass Solution {\n    public int countConsistentStrings(String allowed, String[] words) {\n        char[] al= allowed.toCharArray();\n     
\n\n# Code\n```java []\nclass Solution {\n    public int countConsistentStrings(String allowed, String[] words) {\n        char[] al= allowed.toCharArray();\n        List<Character> l= new ArrayList<>();\n        for(char i: al){\n            l.add(i);\n        }\n        int c=0;\n        for(String word : words){\n            for(char cha: word.toCharArray()){\n                if(!l.contains(cha)){\n                    c+=1;\n                    break;\n                }\n            }\n        }\n        return words.length-c;\n    }\n}\n```
['Java']