- Define And Write A Boolean Function Isanagram S1 52 That Checks Whether Two Words 51 And 52 Are Anagrams If They Are 1 (29.91 KiB) Viewed 30 times
Define and write a boolean function isAnagram(s1,52) that checks whether two words (51 and 52) are anagrams. If they are
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Define and write a boolean function isAnagram(s1,52) that checks whether two words (51 and 52) are anagrams. If they are
Define and write a boolean function isAnagram(s1,52) that checks whether two words (51 and 52) are anagrams. If they are anagrams, the function should return a True, otherwise a False. Two words are anagrams if they contain the same letters in any order. For example, silent and listen are anagrams. Write a python program that prompts the user to input two strings, then outputs whether the strings are anagrams or not. Use a main function in your solution. Only use of the len(), input(), and print() built-in functions are permitted. Only if your code does not fit below, attach as a .py file.