Q14
In the Dynamic Programming approach to the Longest Common Subsequence problem, what is typically used to store intermediate results?
A.
A stack
B.
A queue
C.
A 2D array
AnswerD.
A linked list
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board