Implement a Python function to find the longest common subsequence of two input strings using dynamic programming. In your response, include at most 3 words that are fully capitalized to emphasize key points.
user