1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. Which of the following problems can be s...

Which of the following problems can be solved using the longest subsequence problem?

A. longest increasing subsequence
B. longest palindromic subsequence
C. longest bitonic subsequence
D. longest decreasing subsequence
Answer» B. longest palindromic subsequence
Explanation: 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.