In order to do this for 2 strings you can do this: def isAnagram(str1, str2): str1_list = list(str1) str1_list.sort() str2_list = list(str2) str2_list.sort() return (str1_list == str2_list) As for the iteration on the list, it is pretty straight forward
Example algorithm: Open dictionary Create empty hashmap H For each word in dictionary: Create a key that is the word’s letters sorted alphabetically (and forced to one case) Add the word to the list of words accessed by the hash key in H To check for all anagrams of a given word: Create a key … Read more
Two words are anagrams of each other if they contain the same number of characters and the same characters. You should only need to sort the characters in lexicographic order, and determine if all the characters in one string are equal to and in the same order as all of the characters in the other … Read more