Top | MCQs on Dynamic Programming with Answers | Question 25

Last Updated :
Discuss
Comments

Which of the following problems is closely related to the LPS (Longest Palindromic Subsequence)_ problem and can also be solved using dynamic programming?
 


 

 Longest Common Subsequence Problem
 

 Longest Increasing Subsequence Problem
 

Edit Distance Problem

Subset Sum Problem

Share your thoughts in the comments