# anagram in string
a1=input('Enter the first string :')
a2=input('Enter the second string :')
b1=sorted(a1)
b2=sorted(a2)
print(b1,b2)
if b1==b2:
print('They are anagrams')
else:
print('They are not anagrams')
#output:
--------------------------------------------------------------------------------
case I
Enter the first string :789
Enter the second string :987
['7', '8', '9'] ['7', '8', '9']
They are anagrams
--------------------------------------------------------------------------------
case II
nter the first string :1598
Enter the second string :6951
['1', '5', '8', '9'] ['1', '5', '6', '9']
They are not anagrams
--------------------------------------------------------------------------------
def anagram_checker(first_value, second_value):
if sorted(first_string) == sorted(second_string):
print("The two strings are anagrams of each other.")
out = True
else:
print("The two strings are not anagrams of each other.")
out = False
return out
first_string = input("Provide the first string: ")
second_string = input("Provide the second string: ")
anagram_checker(first_string, second_string)
Print(anagram_checker("python", "typhon"))
True
def isAnagram(str1, str2):
str1_list = list(str1)
str1_list.sort()
str2_list = list(str2)
str2_list.sort()
return (str1_list == str2_list)
def are_anagrams(first, second):
return len(first) == len(second) and sorted(first) == sorted(second)
is_anagram = lambda x1, x2: sorted(x1) == sorted(x2)
print(is_anagram('silent','listen')) # True
print(is_anagram('elivs', 'dead')) # False