9ms Java solution
public class Solution {\n    \n    public boolean isAnagram(String s, String t) {\n        \n        if(s.length() != t.length()) {\n            return false;\n
public class Solution {\n    \n    public boolean isAnagram(String s, String t) {\n        \n        if(s.length() != t.length()) {\n            return false;\n        }\n        \n        int[] count = new int[26];\n\n        for(int i = 0; i < s.length(); i++) {\n            count[s.charAt(i) - 'a']++;\n            count[t.charAt(i) - 'a']--;\n        }\n        \n        for(int x : count) {\n            if(x != 0) return false;\n        }\n        \n        return true;\n    }\n}
['Java']