Domanda di colloquio di Amazon

1) DP problem - find the largest common subsequence