Question d’entretien chez Amazon

1) DP problem - find the largest common subsequence