A palindrome is a string that is the same regardless of whether your read it forward or backward, assuming you ignore the spaces and punctuations. For instance, the string "race car" is a palindrome. So is "a man a plan a canal panama" . Describe how you could use a stack to determine whether a string is palindrome. Trace your algorith for the string "deanaed"

The explanation for this question is describes in the explanation section below.

Explanation:

A palindrome is a number, string, expression or certain character pattern that appears the very same backward as a forward.

Below is an algorithm for the series:

Step 1: Creates an object of generic stack-type of string set.

Step 2: Accept the sequence from those in the user as its entry.

Step 3: Throughout the specified set, disregard the white space.

Step 4: Build an object for the reverse string to be stored.

Step 5: To store the stack into the string, place the object that has come into the stack.

Step 6: Test whether the reversed string equals the initial string.

Step 7: Display the message of success.

Step 8: Display the message of failure when the strings aren't the same.

i think ninja is the best