0 votes 0 votes The time complexity of solving the Longest Common Subsequence problem using Dynamic Programming is : ($m$ and $n$ are lengths of subsequences) $\text{O(m.n)}$ $\text{O(m+n)}$ $\text{O(log m.n)}$ $\text{O(m/n)}$ Others nielit2021dec-scientista + – soujanyareddy13 asked Jan 9, 2022 • edited Jan 17, 2022 by soujanyareddy13 soujanyareddy13 179 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes A.O(m.n) Reference : algorithm - Time complexity of recursive Longest Common Subsequence which uses a map - Stack Overflow Sandeep652025 answered Mar 28, 2023 Sandeep652025 comment Share Follow See all 0 reply Please log in or register to add a comment.