LinkedIn interview question

Similiar question/algorithm for the longest common subsquence problem?