Longest common subsequence is an example of ____________
Greedy algorithm
2D dynamic programming
1D dynamic programming
Divide and conquer
(B) 2D dynamic programming
Explanation:
Longest common subsequence is an example of 2D dynamic programming.
