Print Longest Increasing Subsequence
LIS · 36:36LIS · Detailed Dry Run · Why It is SpecialMy notes
Sign in to keep private notes on every station, with video timestamps.
About this video
Video lecture "Print Longest Increasing Subsequence" by codestorywithMIK, part of the Dynamic Programming chapter of the Data Structures & Algorithms course (36:36).
- Patterns
- LIS, Subsequences/Strings (LCS, Edit Distance)
- Chapter
- Dynamic Programming
- Duration
- 36:36
Related problems
- Maximum Alternating Subsequence Sum (LeetCode 1911)
- Longest Increasing Subsequence (LeetCode 300)
- Maximum Length of Pair Chain (LeetCode 646)
- Longest String Chain (LeetCode 1048)
- Maximum Balanced Subsequence Sum (LeetCode 2926)
- Largest Divisible Subset (LeetCode 368)
- Print Longest Common Subsequence
- Shortest Common Supersequence