You are viewing a single comment's thread. Return to all comments →
Relevant Wikipedia article: https://en.wikipedia.org/wiki/Longest_common_subsequence_problem
A straightforward solution uses O(n^2) time and space. Optimizations can reduce both of these.
Seems like cookies are disabled on this browser, please enable them to open this website
Common Child
You are viewing a single comment's thread. Return to all comments →
Relevant Wikipedia article: https://en.wikipedia.org/wiki/Longest_common_subsequence_problem
A straightforward solution uses O(n^2) time and space. Optimizations can reduce both of these.