Which of the following problems should be solved using dynamic programming?
|C.||longest common subsequence|
|Answer» 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.|
Login to Continue
It will take less than 2 minutes