Using Python, given a reference string followed by four more strings, create a program that determines whether those 4 strings are anagrams of the reference string. The output should be a list of boolean values that show if those strings are anagrams (respectively). There is no need to check if a string is a valid word or not. Do not use sorted() and Counter An anagram means that each string has the exactly the same number of each letter. Given this, count the letters of the string by Using a dictionary and use each letter as a key into the dictionary ; this will give you a dictionary of letter counts. Compare the counts by maintaning one set of counts and increment the counts for the first string, and then decrement the counts for the second string. The strings are anagrams if all the counts end up as zero.
Using Python, given a reference string followed by four more strings, create a
There is no need to check if a string is a valid word or not.
Do not use sorted() and Counter
An anagram means that each string has the exactly the same number of each letter.
Given this, count the letters of the string by Using a dictionary and use each letter as a key into the dictionary ; this will give you a dictionary of letter counts.
Compare the counts by maintaning one set of counts and increment the counts for the first string, and then decrement the counts for the second string. The strings are anagrams if all the counts end up as zero.
![User inputs the following strings (first string is the reference string):
listen
silent
lentss
lentis
slents
Output:
[True, False, True, False]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3752271c-dc55-484f-8d2a-883815fbd402%2F59a5233a-ebef-44a8-8a9c-0a18d57f22b7%2Fqalnvrr_processed.png&w=3840&q=75)
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images
