@@ -0,0 +1,1653 @@
+import java.util.*;%0A%0Apublic class Solution %7B%0A    public List%3CList%3CString%3E%3E groupAnagrams(String%5B%5D strs) %7B%0A        List%3CList%3CString%3E%3E list = new ArrayList%3CList%3CString%3E%3E();%0A        Anagrams%5B%5D grams = new Anagrams%5Bstrs.length%5D;%0A        for(int i=0; i%3Cstrs.length; i++) %7B%0A            grams%5Bi%5D = new Anagrams(strs%5Bi%5D);%0A        %7D%0A        Arrays.sort(grams);%0A        %0A        for(Anagrams g : grams) %7B%0A            System.out.println(%22%3C%22 + g.src + %22_:_%22 + g.agm + %22%3E%22);%0A        %7D%0A        %0A        ArrayList%3CString%3E lst = new ArrayList%3CString%3E();%0A        for(int i=0; i%3Cstrs.length; i++) %7B%0A            if(lst.size() != 0 && grams%5Bi%5D.agm.compareTo(grams%5Bi-1%5D.agm) != 0) %7B%0A                list.add(lst);%0A                lst = new ArrayList%3CString%3E();%0A            %7D%0A            lst.add(grams%5Bi%5D.src);%0A        %7D%0A        if(lst.size() %3E 0) list.add(lst);%0A        // //Sorting%0A        // Collections.sort(list, new Comparator%3CList%3E() %7B%0A        //     @Override%0A        //     public int compare(List list1, List list2)%0A        //     %7B%0A        //         return list2.size() - list1.size();%0A        //     %7D%0A        // %7D);%0A        return list;%0A    %7D%0A%7D%0A%0Aclass Anagrams implements Comparable%3CAnagrams%3E %7B%0A    public String src;%0A    public String agm;%0A    public Anagrams(String s) %7B%0A        src = s;%0A        if (s.length() %3E 0) %7B%0A            char%5B%5D ss = s.toCharArray();%0A            Arrays.sort(ss);%0A            agm = new String(ss);%0A        %7D else %7B%0A            agm = s;%0A        %7D%0A%7D%0A    %0A    public int compareTo(Anagrams other) %7B%0A        if(this.agm.compareTo(other.agm) == 0) return this.src.compareTo(other.src);%0A        return this.agm.compareTo(other.agm);%0A    %7D%0A%7D%0A

Create Group_Anagrams.java