Question: What is the time complexity of the longest common subsequence problem using dynamic programming?

Options:

1. O(n)
2. O(m)
3. O(n*m)
4. O(n^2)

Correct Answer: O(n*m)

Solution:

The longest common subsequence problem can be solved using a dynamic programming approach with a time complexity of O(n*m), where n and m are the lengths of the two sequences.