Two strings are anagrams if they are permutations of each other. for example, "aaagmnrs" is an anagram of "anagrams". given an array of strings, remove each string that is an anagram of an earlier string, then return the remaining array in sorted order. for example, given the strings s = ['code', 'doce', 'ecod', 'framer', 'frame'], the strings 'doce' and 'ecod' are both anagrams of 'code' so they are removed from the list. the words 'frame' and 'framer' are not anagrams due to the extra 'r' in 'framer', so they remain. the final list of strings in alphabetical order is ['code', 'frame', 'framer'].