Finds the longest subsequence present in both sequences by building solutions to smaller subproblems.
Explain code with DocComment! Try out your own code!