Two words are anagrams of each other if they contain the same letters in them. So left is an anagram of felt and vice-versa. A Super Anagram is a special kind of anagram. A Super Anagram is an anagram whose first and last letters are the same. Your program needs to read in two words on a single line. If the pair of words are Super Anagrams of each other, print out Super Anagram!. If the pair of words is not a Super Anagram (so a human couldn't read it), then print out Huh?. For one-letter words, the first letter is the last letter. So, for example: Enter words: brain brian Super Anagram! and another example: Enter words: too two Huh?

EBK JAVA PROGRAMMING
9th Edition
ISBN:9781337671385
Author:FARRELL
Publisher:FARRELL
Chapter2: Using Data
Section: Chapter Questions
Problem 1GZ
icon
Related questions
Question
grok
Introduction to Programming (Python)
academy
8 - Looping and lists
Yuor biran is an azamnig thnig
Instructions Tutoring
O Problem
pi
Image source
na
Two words are anagrams of each other if they contain the same letters in them. So
na
left is an anagram of felt and vice-versa. A Super Anagram is a special kind of
So
anagram. A Super Anagram is an anagram whose first and last letters are the same.
So
if
Your program needs to read in two words on a single line. If the pair of words are Super
Anagrams of each other, print out Super Anagram!. If the pair of words is not a Super
Anagram (so a human couldn't read it), then print out Huh?. For one-letter words, the
first letter is the last letter.
So, for example:
Enter words: brain brian
Super Anagram!
and another example:
Enter words: too two
Huh?
Transcribed Image Text:grok Introduction to Programming (Python) academy 8 - Looping and lists Yuor biran is an azamnig thnig Instructions Tutoring O Problem pi Image source na Two words are anagrams of each other if they contain the same letters in them. So na left is an anagram of felt and vice-versa. A Super Anagram is a special kind of So anagram. A Super Anagram is an anagram whose first and last letters are the same. So if Your program needs to read in two words on a single line. If the pair of words are Super Anagrams of each other, print out Super Anagram!. If the pair of words is not a Super Anagram (so a human couldn't read it), then print out Huh?. For one-letter words, the first letter is the last letter. So, for example: Enter words: brain brian Super Anagram! and another example: Enter words: too two Huh?
Expert Solution
steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Knowledge Booster
Random Class and its operations
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781305480537
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT