Question
Description Write a Java program that identifies pair isograms. An isogram is a word without a repeating letter. Example isograms are palindromes, incomputable, and computerizably.
Description
Write a Java program that identifies pair isograms. An isogram is a word without a repeating letter. Example isograms are palindromes, incomputable, and computerizably. A pair isogram is a word where each letter appears exactly twice. Example pair isograms are teammate, intestines, and noon.
Input
The first input line will be a positive integer n, indicating the number of words to be processed. Each of the following n input lines contains a word.
Output
Print each input word along with a message indicating whether or not it is pair isograms. Follow the format illustrated in Sample Output. The input word may contain uppercase, lowercase, and punctuation, which you shall ignore in determining whether the word is a pair isogram. For examples, Shannah's and Hello.O'he are a pair isograms.
Sample Input
3 teammate ali dood
Sample Output
teammate --- pair isogram ali --- not pair isogram dood --- pair isogram
Additional Information
You should use a Scanner to read the input values.
Do not prompt for input. The input will be there.
You should use System.out.println() to generate your output.
The output line has to match exactly.
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started