Question: What is the space complexity of the dynamic programming solution for the Longest Common Subsequence problem?
Options:
Correct Answer: O(m * n)
Solution:
The space complexity of the dynamic programming solution for the Longest Common Subsequence problem is O(m * n), where m and n are the lengths of the two sequences.