Longest Common Subsequence (LeetCode 1143)
MediumLeetCode 1143 · Subsequences/Strings (LCS, Edit Distance) · Google, Amazon +16 · 39:18Longest Common Subsequence · Recursion · Memo · Optimal · Leetcode 1143My notes
Sign in to keep private notes on every station, with video timestamps.
Pause here and write your approach in two lines. Compare it with MIK's when the video ends.
Sign in to write your approach →About this video
Video solution for LeetCode 1143 Longest Common Subsequence by codestorywithMIK: Dynamic Programming, Medium. Topics: String, Dynamic Programming, Longest Common Subsequence. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- String, Dynamic Programming, Longest Common Subsequence
- Patterns
- Subsequences/Strings (LCS, Edit Distance)
- Chapter
- Dynamic Programming
- Duration
- 39:18
Related problems
- Maximum Alternating Subsequence Sum (LeetCode 1911)
- Longest Increasing Subsequence (LeetCode 300)
- Maximum Balanced Subsequence Sum (LeetCode 2926)
- Print Longest Common Subsequence
- Shortest Common Supersequence
- Print Shortest Common Supersequence (LeetCode 1092)
- Edit Distance (LeetCode 72)
- Palindromic Substrings (LeetCode 647)