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
(d) Greedy algorithm
The question was asked in an online quiz.
Origin of the question is Longest Common Subsequence topic in portion Dynamic Programming of Data Structures & Algorithms II