ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
Which of the following problems should be solved using dynamic programming?
Correct Answer: C — Longest common subsequence
The longest common subsequence problem has both, optimal substructure and overlapping subproblems. Hence, dynamic programming should be used the solve this problem.