We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
The simple recursive solution does not have complexity of O(N^2) time. It is way much bigger, because of the branching. Take a look at Cormen's chapter on the problem.
Magic Spells
You are viewing a single comment's thread. Return to all comments →
Thank you very much, Danilo. That really helped.
This was a great example of a solution that required memoization because the simple recursive solution has a complexity of O(N^2).
Hello Alexhans,
I'm really pleased that my answer was helpful :D
Thank you sooo much for the endorsement!
Danilo, You really help! Thanks, really good way to teach. It is better than code, more useful.
Thank you for your kind words :D
Hello Danilo, can i say that intersection of the characters present in the two strings, can be defined as the longest subsequence??
The simple recursive solution does not have complexity of O(N^2) time. It is way much bigger, because of the branching. Take a look at Cormen's chapter on the problem.