My solutions in C++, Java, Python, C, C#, JavaScript, and Ruby
C++:\n\n            int c[256] = {};\n            for (int i = 0; i < s.size(); i++) { c[s[i]]++; }\n            for (int i = 0; i < t.size(); i++) { c[t[i]]--;
C++:\n\n            int c[256] = {};\n            for (int i = 0; i < s.size(); i++) { c[s[i]]++; }\n            for (int i = 0; i < t.size(); i++) { c[t[i]]--; }\n            for (int i = 0; i < 256; i++) {\n                if (c[i]) { return false; }\n            }\n            return true;\n\nJava:\n\n\n        int[] c = new int[256];\n        for (int i = 0; i < s.length(); i++) {\n            c[s.charAt(i)]++;\n        }\n        for (int i = 0; i < t.length(); i++) {\n            c[t.charAt(i)]--;\n        }\n        return Arrays.stream(c).reduce(0, (a, b) -> Math.abs(a) + Math.abs(b)) == 0;\n\nPython:\n\n    return sorted(s) == sorted(t)\n\nC:\n\n    bool isAnagram(char* s, char* t) {\n        int c[256];\n        for (int i = 0; i < 256; i++) { c[i] = 0; }\n        while (*s != '\\0') { c[*s++]++; }\n        while (*t != '\\0') { c[*t++]--; }\n        for (int i = 0; i < 256; i++) {\n            if (c[i] != 0) {\n                return false;\n            }\n        }\n        return true;\n    }\n\nC#:\n\n        return new string(s.OrderBy(c => c).ToArray()) == new string(t.OrderBy(c => c).ToArray());\n\nJavaScript:\n\n    return s.split('').sort().toString() === t.split('').sort().toString()\n\nRuby:\n\n    return s.split('').sort() == t.split('').sort()
['Python', 'Java']