Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Verify Anagrams by janusztracz73ms
def verify_anagrams(first_word, second_word):
first_word = first_word.replace(" ", "")
s = second_word.replace(" ","")
l = []
k = []
for x in s.lower():
l.append(x)
for y in first_word.lower():
k.append(y)
k = sorted(k)
l = sorted(l)
print(k)
print(l)
if k == l:
return True
else:
return False
# kopiael = l[0:len(l)]
# kopiaka = k[0:len(l)]
# for z in range(len(l)):
# if l[z] in k:
# p = l[z]
# kopiael.remove(p)
# kopiaka.remove(p)
# if len(kopiael) != 0:
# return False
# else:
# return True
print(verify_anagrams("Programming", "Gram Ring Mop"))
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert isinstance(verify_anagrams("a", 'z'), bool), "Boolean!"
assert verify_anagrams("Programming", "Gram Ring Mop") == True, "Gram of code"
assert verify_anagrams("Hello", "Ole Oh") == False, "Hello! Ole Oh!"
assert verify_anagrams("Kyoto", "Tokyo") == True, "The global warming crisis of 3002"
Oct. 21, 2016