Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Verify Anagrams by Rafal.U
def verify_anagrams(first_word, second_word):
tab_alfabet = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "ł", "m", "n", "o", "p", "r", "s", "t", "u", "w", "z", "ż", "ź","x", "y", "Q"]
first_word = first_word.lower(); # zamiana znaków w stringu na małe litery
second_word = second_word.lower(); # zamiana znaków w stringu na małe litery
for i in tab_alfabet: # sprawdzenie kazdej lietry alfabetu
if first_word.count(i)!= second_word.count(i): # porownanie liczby wystapien kazdej litery alfabetu w stringu first_word i second_word
return False
return True # jezeli liczba wystapien poszczegolnych liter alfabetu w stringach jest taka sama mamy 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"
Nov. 12, 2016
