anagram.py

anagram.py

# coding: utf-8

words = ['cat','dog','tac','star','rats']

def anagram(str1,str2):
	s1 = set(str1)
	s2 = set(str2) # ==> sorted(list(str2)) less efficient!
	return s1 == s2 # ==> if s1==s2: return True else: return False

#print(anagram_solver('cpa','tac'))

def anagram_solver(words):
    res = []
    for word in words:
        for another_word in words:
            if another_word != word and anagram(word, another_word):
                res.append(word)

    return sorted(list(set(res)))
print(anagram_solver(words))

# O(N^2) --> Current algorithm