@@ -0,0 +1,724 @@
+public class Solution %7B%0A    public boolean isAnagram(String s, String t)%7B%0A        if(s.length() != t.length()) return false;%0A        int%5B%5D alphabets = new int%5B26%5D;%0A        for (int i = 0; i %3C s.length(); i++) %7B%0A            ++alphabets%5Bs.charAt(i) -'a'%5D;%0A        %7D%0A        for (int i = 0; i %3C t.length(); i++) %7B%0A            if(--alphabets%5Bt.charAt(i)-'a'%5D %3C 0)%0A                return  false;%0A        %7D%0A        return true;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        String s1 = %22anagram%22, t1 = %22nagaram%22;%0A        String s2 = %22rat%22, t2 = %22cat%22;%0A        Solution solution = new Solution();%0A        System.out.println(solution.isAnagram(s1, t1));%0A        System.out.println(solution.isAnagram(s2, t2));%0A    %7D%0A%7D%0A

complete problem 241