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