## Finding the Actual Longest Common Subsequence from Dynamic Programming Table

It aims to find the longest subsequence present in both input sequences, where a subsequence is a sequence that appears in the same relative order but not necessarily consecutively.