saiajc·il y a 2 ans·discussLongest common subsequence can be solved in at most quadratic time via dynamic programming.