Longest Common Subsequence

Category: Dynamic Programming

Difficulty: intermediate

Description: Find longest common subsequence

Time Complexity: O(mn)

Space Complexity: O(mn)

Related LeetCode Problems

• 1143. Longest Common Subsequence (Medium)
• 97. Interleaving String (Hard)
• 72. Edit Distance (Hard)
• 1092. Shortest Common Supersequence (related concept) (Hard)
• 583. Delete Operation for Two Strings (Medium)
• 712. Minimum ASCII Delete Sum for Two Strings (Hard)
• 97. Interleaving String (duplicate) (Hard)
• 392. Is Subsequence (Easy)
• 718. Maximum Length of Repeated Subarray (Medium)
• 115. Distinct Subsequences (Hard)