Back to course home
0% completed
Vote For New Content
what is the time and space complexity of the top-down solution?
Lucifer
Mar 22, 2022
what is the time and space complexity of the top-down solution?
0
0
Comments
Comments
G
Gary 3 years ago
"The time and space complexity of the above algorithm is O(m*n) O(m∗n), where ‘m’ and ‘n’ are the lengths of the two input strings."
G
Gary 3 years ago
sorry, just realized what i quoted is for the bottom-up solution. Seems like the top-down would be O (m * n * max(n,m))?
On this page
Problem Statement
Try it yourself