Longest common subsequence is an example of ____________
(a) Greedy algorithm
(b) 2D dynamic programming
(c) 1D dynamic programming
(d) Divide and conquer
I have been asked this question by my college director while I was bunking the class.
My question is from Longest Common Subsequence topic in portion Dynamic Programming of Data Structures & Algorithms II