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__Kotas
def verify_anagrams(first_word, second_word):
f=list(first_word.lower())
s=list(second_word.lower())
for i in range (len(f)-1):
for j in range (len(f)-1-i):
if(f[j]>f[j+1]):
f[j+1], f[j] = f[j], f[j+1]
for i in range (len(s)-1):
for j in range (len(s)-1-i):
if(s[j]>s[j+1]):
s[j+1], s[j] = s[j], s[j+1]
while(f.count(' ')>0):
f.remove(' ')
while(s.count(' ')>0):
s.remove(' ')
x=str(f)
y=str(s)
print(x)
print(y)
if(len(x)==len(y)):
if(x==y):
return True
else:
return False
else:
return False
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. 6, 2016
