saiajc·há 2 anos·discussLongest common subsequence can be solved in at most quadratic time via dynamic programming.