Loading practice questions
Which of the following problems should be solved using dynamic programming?
(C) Longest common subsequence
Explanation:
The longest common subsequence problem has both, optimal substructure and overlapping subproblems. Hence, dynamic programming should be used the solve this problem.