Dynamic Programming, Programming, Algorithms, Data, Coding Interviews.
strings is a subsequence that is common to both strings. If there is no common subsequence, return 0. There can be multiple possible common subsequences of the longest length but need to just return the length of the longest common subsequence. So this is an optimization problem where the solution