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
This question is part of this quiz :
Dynamic Programming Quiz