Which of the following methods can be used to solve the longest common subsequence problem?
Posted: Wed Jul 13, 2022 7:40 pm
a) Recursion
b) Dynamic programming
c) Both recursion and dynamic programming
d) Greedy algorithm
b) Dynamic programming
c) Both recursion and dynamic programming
d) Greedy algorithm