A palindrome is a string that reads the same forward and backward. For example deed and level are palindromes. Write an algorithm in pseudocode that tests whether a string is a palindrome. Implement your algorithm as a static method in Java. Exercise and Project in Chapter 5 asked you to describe how to do this using a stack.
Exercise
A palindrome is a string of characters (a word, phrase, or sentence) that is the same regardless of whether you read it forward or backward—assuming that you ignore spaces, punctuation, and case. For example, Race car is a palindrome. So is A man, a plan, a canal: Panama. Describe how you could use a stack to test whether a string is a palindrome.
Write a Java program that uses a stack to test whether an input string is a palindrome. Exercise 11 defines “palindrome” and asks you to describe a solution to this problem.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.