Which of the following methods can be used to solve the longest common subsequence problem?
|C.||both recursion and dynamic programming|
|Answer» C. both recursion and dynamic programming|
|Explanation: both recursion and dynamic programming can be used to solve the longest subsequence problem.|
Login to Continue
It will take less than 2 minutes