Longest Increasing Subsequence (LeetCode 300) – Part 2
MediumLeetCode 300 · LIS · Google, Amazon +26 · 31:22Longest Increasing Subsequence · BOTTOM UP · FULL INTUITION · DP Concepts & Qns - 12 · Leetcode-300My 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 (part 2 of 3) for LeetCode 300 Longest Increasing Subsequence by codestorywithMIK: Dynamic Programming, Medium. Topics: Array, Binary Search, Dynamic Programming, Longest Increasing Subsequence. Watch the explanation, then check the code and solve it on LeetCode.
- Difficulty
- medium
- Topics
- Array, Binary Search, Dynamic Programming, Longest Increasing Subsequence
- Patterns
- LIS, Subsequences/Strings (LCS, Edit Distance)
- Chapter
- Dynamic Programming
- Duration
- 31:22
Related problems
- Maximum Alternating Subsequence Sum (LeetCode 1911)
- 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
- Print Shortest Common Supersequence (LeetCode 1092)