Q42
Which problem is best solved using Dynamic Programming by maintaining a 2D table to store results?
A.
Quick Sort
B.
Depth-First Search
C.
Binary Search
D.
Longest Common Subsequence
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board