Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Verify anagrams solution in Clear category for Verify Anagrams by graffme
def verify_anagrams(first_word, second_word):
#zapisz małymi literami i pozbądź się spacji
#zamień na tablice1 i 2
#przeiteruj tablice1, jeśli znajdziesz literę w tablicy 2, wyrzuć z obu i kontynuuj; inaczej False, uwzględnij długości tablic
w1 = first_word.replace(" ", "")
w2 = second_word.replace(" ", "")
w1List = list(w1.lower())
w2List = list(w2.lower())
is_anagram = False
if len(w1List) == len(w2List):
for pos1 in range(len(w1List)):
#print(w1List[pos1])
for char in w2List:
if char == w1List[pos1]:
w2List.remove(char)
is_anagram = True
#print(w2List)
break
else:
is_anagram = False
else:
is_anagram = False
if is_anagram and (len(w2List) == 0):
is_anagram = True
else:
is_anagram = False
return is_anagram
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"
assert verify_anagrams("bcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTU", "TSRQPONMLKJIHGFEDCBAzyxwvutsrqponmlkjihgfedcbaZYXWVUTSRQPONMLKJIHGFEDCBAzyxwvutsrqponmlkjihgfedcba") == False, "it worked"
Jan. 11, 2017