Determine whether a string is a palindrome
A palindrome is a string of characters that reads the same from right to left as it does from left to right, regardless of punctuation and spaces. Some famous English palindromes include the following “Madam, I’m Adam”, and “Never odd or even”. Of course, a simpler example would be the world “radar”.
The specifications for this assignment are:
Write and test a non-recursive solution in Java that determines whether a string is a palindrome
•Your program should consist of at least two methods: (1) the main method (2) the method which performs the task of determining whether the specified string is a palindrome. You should name this method isPalindrome. You should name the class that contains your “main” method and the isPalindrome method FindPalindrome.
•
You must use a Stack and a Queue in your solution:Make sure to Write your own Stack and Queue based on the Vector in the Java API and use those in your solution. You should name those classes StackVector and QueueVector respectively. Do not use java.util*
•Solution must prompt user to test another string and act appropriately according to response. If the responds “y”, then the user should be prompted to enter a string, else the program should terminate.
The output from your program should appear similar to the following example:
Extracted text: Enter string: radar The string "radar" is a palindrome. Test another string (y or n): y Enter string: Madam I'm Adam. The string "Madam I'm Adam." is a palindrome. Test another string (y or n): y Enter string: Shadow of the Tomb Raider The string "Shadow of the Tomb Raider" is not a palindrome. Test another string (y or n): y Enter string: sator arepo tenet opera rotas The string "sator arepo tenet opera rotas" is a palindrome. Test another string (y or n): n ...done|