Simple Java 4ms solution
public class Solution {\n        public boolean isAnagram(String s, String t) {\n            if (s.length() != t.length()) return false;\n            char[] cs 
    public class Solution {\n        public boolean isAnagram(String s, String t) {\n            if (s.length() != t.length()) return false;\n            char[] cs = s.toCharArray();\n            char[] ct = t.toCharArray();\n            int[] map = new int[127];\n            int count = 0;\n            for (int i = 0; i < cs.length; i++) {\n                if(++map[cs[i]] == 1) count ++;\n                if(--map[ct[i]] == 0) count --;\n            }\n            return count == 0;\n        }\n    }
['Java']