Question: A palindrome is any string that is exactly the same as its reversal, like I, or DEED, or RACECAR, or TATTARRATTAT^2, or MADAM, I'M ADAM

A palindrome is any string that is exactly the same as its reversal, like I, or DEED, or RACECAR, or TATTARRATTAT^2, or "MADAM, I'M ADAM" if we ignore punctuation. Describe and analyze an algorithm to find the longest subsequence of a given string that is also a palindrome. For example, the longest palindrome subsequence of MAHDYNAM-ICPROGRAMZLETMESHOWYOUTHEM is MHYMRORMYHM. Structure your solution as in 1(b)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
