Dynamic Programming - Longest Common Subsequence

Solve a problem related to the longest common subsequence using dynamic programming

Describe the dynamic programming approach to finding the longest common subsequence of two sequences.

• Dynamic programming is applicable to problems with optimal substructure and overlapping subproblems.

• Dynamic programming is applicable only to problems with optimal substructure.

• Dynamic programming is applicable only to problems with overlapping subproblems.