The 3 ms fastest  AC for alphabets and 6 ms universal AC for Unicode in Java
public class Solution {\n        //6ms solution for inputs contain unicode characters\n        public boolean isAnagram0(String s, String t) {\n            if(s
    public class Solution {\n        //6ms solution for inputs contain unicode characters\n        public boolean isAnagram0(String s, String t) {\n            if(s==null || t==null || s.length()!=t.length())\n                return false;\n            char[] sc = s.toCharArray();\n            char[] tc = t.toCharArray();\n            Arrays.sort(sc);\n            Arrays.sort(tc);\n            if(new String(sc).equals(new String(tc)))\n                return true;\n            return false;\n        }\n        \n        //3ms basic ASCII \n        public boolean isAnagram(String s, String t) {\n            if(s==null || t==null || s.length()!=t.length())\n                return false;\n            int[] alphabets = new int[256];\n            char[] sc = s.toCharArray();\n            char[] tc = t.toCharArray();\n            for(char c : sc){\n                alphabets[c]++;\n            }\n            for(char c : tc){\n                if(alphabets[c]>0)\n                    alphabets[c]--;\n                else\n                    return false;\n            }\n            return true;\n        }\n    }
['Array', 'Sorting', 'Java']