saiajc·vor 2 Jahren·discussLongest common subsequence can be solved in at most quadratic time via dynamic programming.