Problem Statement  
Two phrases are anagrams if they are permutations of each other, ignoring spaces and capitalization. For example, "Aaagmnrs" is an anagram of "anagrams", and "TopCoder" is an anagram of "Drop Cote". Given a String[] phrases, remove each phrase that is an anagram of an earlier phrase, and return the remaining phrases in their original order.  
Definition  
 
Constraints  
  phrases contains between 2 and 50 elements, inclusive.  
  Each element of phrases contains between 1 and 50 characters, inclusive.  
  Each element of phrases contains letters ('a''z' and 'A''Z') and spaces (' ') only.  
  Each element of phrases contains at least one letter.  
Examples  
0)  
 
1)  
 
2)  
