Which of the following problems is closely related to the Subsets Sum problem and can also be solved using dynamic programming?
Longest Common Subsequence Problem
Longest Palindromic Subsequence Problem
Coin Change Problem
Optimal Binary Search Tree Problem
This question is part of this quiz :
Dynamic Programming Quiz