Q18
What is the space complexity of a typical Dynamic Programming solution for the Longest Common Subsequence problem?
A.
O(1)
B.
O(n log n)
C.
O(n2)
AnswerD.
O(n)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board