[Java][Golang] Using o(n^2) and easy you understand
Code\n\n//Java solution\nclass Solution {\n    public int countConsistentStrings(String allowed, String[] words) {\n    int count = 0;\n\n        for(String str
# Code\n```\n//Java solution\nclass Solution {\n    public int countConsistentStrings(String allowed, String[] words) {\n    int count = 0;\n\n        for(String str : words){\n            int check = 0;\n                for(int j = 0; j < str.length(); j++){\n                    if(allowed.contains(String.valueOf(str.charAt(j)))){\n                        check++;\n                    }\n                }\n                if(check == str.length()){\n                    count++;\n                }\n        } \n    \n    \n    return count;\n    }\n}\n\n//Golang solution\n//solution : 1\nfunc countConsistentStrings(allowed string, words []string) int {\n    count := 0\n    for _, s := range words {\n        for i, v := range s {\n            if strings.Contains(allowed, string(v)) == false {\n                    break\n            }\n            if i == len(s)-1 {count++}    \n        }\n    }\n\n    return count\n}\n//solution : 2\nfunc countConsistentStrings(allowed string, words []string) int {\n    count := 0\n\n    for _, v := range words {\n        for _, n := range allowed {\n            v = strings.ReplaceAll(v, string(n), "")\n        }\n        if len(v) == 0 {\n            count++\n        }\n    }\n\n\n    return count\n}\n```
['Java', 'Go']