Home »
MCQs »
Algorithms MCQs
The Dynamic Programming approach to LCS has an auxiliary space complexity of O(1).
34. The Dynamic Programming approach to LCS has an auxiliary space complexity of O(1).
- True
- False
- Can't say
- None
Answer
The correct answer is: B) False
Explanation
The auxiliary space complexity of the standard dynamic programming approach to LCS is O(m * n), where m and n are the lengths of the input strings.