LCS Longest (maximum) common subsequence

Longest Common Subsequence Problem. Solution both Iterative and Recursive.

Constrained LCS. Given two sequences X, Y and a constrained sequence P, a sequence Z is a constrained longest common subsequence for X and Y with respect to P if Z is the longest subsequence of X and Y such that P is a subsequence of Z.