@@ -0,0 +1,476 @@
+package leetcode.valid_anagram;%0A%0Apublic class Solution %7B%0A    public boolean isAnagram(String s, String t) %7B%0A        if(s.length() != t.length()) return false;%0A        int%5B%5D bucket = new int%5B26%5D;%0A        for(char c : s.toCharArray())%7B%0A            bucket%5Bc - 'a'%5D++;%0A        %7D%0A        for(char c : t.toCharArray())%7B%0A            bucket%5Bc - 'a'%5D--;%0A        %7D%0A        for(int i = 0; i %3C 26; i++)%7B%0A            if(bucket%5Bi%5D != 0) return false;%0A        %7D%0A        return true;%0A    %7D%0A%7D%0A

Add java solution for 242. Valid Anagram