Vidyalelo
Data Structure · Q252

Dynamic Programming in Data Structures

Programming · Data Structure · question 252

Q252

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

A.
Longest increasing subsequence
B.
Longest palindromic subsequence
Answer
C.
Longest bitonic subsequence
D.
Longest decreasing subsequence

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board