Simple fast java solution (beats 97%)
public boolean isAnagram(String s, String t) {\n        \n        int[] charsMap = new int['z'-'a'+1];\n        \n        for(char c: s.toCharArray()) {\n      
    public boolean isAnagram(String s, String t) {\n        \n        int[] charsMap = new int['z'-'a'+1];\n        \n        for(char c: s.toCharArray()) {\n            int pos = c - 'a';\n            charsMap[pos]++;\n        }\n        \n        for(char c: t.toCharArray()) {\n            int pos = c - 'a';\n            charsMap[pos]--;\n        }\n        \n        for(int count: charsMap) {\n            if(count != 0) {\n                return false;\n            }\n        }\n        \n        return true;\n    }
['Java']