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