Question d’entretien chez LinkedIn

Similiar question/algorithm for the longest common subsquence problem?