Problem:
Question 1- Write a Program to check if a string is a Perfect Pangram, Pangram or None.
Pangram is a string that contains all alphabets in it at least once Perfect pangram is a string that contains all alphabets occurring only once. If it misses one alphabets, it is not a Pangram.
HOW to IMPLEMENT : store the string in an array. Use another array to count the frequency.
-Example:
•THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG. [Pangram ]
•TV quiz drag nymphs blew JFK cox. [ Perfect Pangram]
Question 2- Write a program to check if a string is palindrome.
In a while loop, ask the user for a string. If the user types quit, exit the program. Else, store the string in an array. Scan the string if it is a palindrome. String can be even or odd length.
Please show code with comments so I can follow what you are doing.