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).

1. True
2. False
3. Can't say
4. 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.