Question
What is the time complexity of the above dynamic programming implementation of the longest common subsequence problem where length of one string is "m and the length of the other string is "n?
Answer: Option D
Was this answer helpful ?
The time complexity of the above dynamic programming implementation of the longest common subsequence is O(mn).
Was this answer helpful ?
Submit Solution