ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
Which of the following problems can be solved using the longest subsequence problem?
Correct Answer: B — Longest palindromic subsequence
To find the longest palindromic subsequence in a given string, reverse the given string and then find the longest common subsequence in the given string and the reversed string.