Q139
Which of the following methods can be used to solve the longest common subsequence problem?
A.
Recursion
B.
Dynamic programming
C.
Both recursion and dynamic programming
AnswerD.
Greedy algorithm
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board