Write a program using stacks that tests whether or not a word, expression or number is a palindrome. A palindrome is a word or expression that reads the same forwards and backwards. (ignore punctuation and blanks) Test at least 10 phrases and words.
Be sure to label any palindromes as numeric or string in the output.
Examples of palindromes:
radar
Able was I ere I saw Elba
Madam I’m Adam
racecar
1991
2002
A Toyota’s a Toyota.
In a container of candies there are 5 colors randomly placed: red, yellow, green blue and white. Assume that the container holds a maximum of 15 candies. Use a stack program to simulate randomly placing some (between 5 and 12 candies) initially into the container (stack).
Now once that is done have the "user" choose a color and using ONLY stack functions remove all candies of that color. All candies in the container (stack) that are NOT of that color are returned to the candy in the same order they were in prior to the color removal. Actually loop the program twice to simulate "filling" and "removing" two sets of candies. Don't assume that there are necessarily all colors of candy all the time...so for example someone might want all red candies but there might not be any red candies at that time.
Fill the container (or partially fill) only ONCE for each run. Here is an example: Suppose you place candies in this order: R R Y B G R B Y B G Y R B W B G Then the stack would look like this:
R
R
Y
B
G
R
B
Y
B
G
Y
R
B
W
B
G (top of stack)
If you asked to remove all green the resulting stack would be:
R
R
Y
B
R
B
Y
B
Y
R
B
W
B(top of stack)