3m fastest java solution
public class Solution {\n        public boolean isAnagram(String s, String t) {\n            int length = s.length();\n            if(length != t.length()) {\n 
    public class Solution {\n        public boolean isAnagram(String s, String t) {\n            int length = s.length();\n            if(length != t.length()) {\n                return false;\n            }\n            char[] str_s = s.toCharArray();\n            char[] str_t = t.toCharArray();\n            int[] mask = new int[256];\n            for(char c : str_s) {\n                mask[c]++;\n            }\n            for(char c : str_t) {\n                if(mask[c] > 0) {\n                    mask[c]--;\n                } else {\n                    return false;\n                }\n            }\n            return true;\n        }\n    }
['Java']