saiajc·2 tahun yang lalu·discussLongest common subsequence can be solved in at most quadratic time via dynamic programming.