title: find the longest sequence S that is a subsequence of A,B,C string
body: <p>Give a polynomial time algorithm that takes three strings, A, B and C, as input, and returns the longest sequence S that is a subsequence of A, B, and C.</p>