Loading repovive.com/roadmaps/dynamic-programming
Roadmaps
Dynamic Programming
Longest Increasing Subsequence
Problemset
Discussion
AI Helper
Recursion Fundamentals
0/42
Dynamic Programming Fundamentals
0/44
1D DP
0/41
Multi-Dimensional DP
0/40
Knapsack
0/43
Knapsack Variations
0/46
Prefix Sums
0/44
Longest Increasing Subsequence
0/47
1
Intro
2
Vocabulary - Subsequence
3
LeetCode 300 Longest Increasing Subsequence - Problem Statement
4
LeetCode 300 Longest Increasing Subsequence - Why Greedy Fails
5
LeetCode 300 Longest Increasing Subsequence - State Design
6
LeetCode 300 Longest Increasing Subsequence - Transition
7
LeetCode 300 Longest Increasing Subsequence - Implementation
8
LeetCode 300 Longest Increasing Subsequence - Walkthrough
9
Challenge: LIS Reconstruction
10
Quiz: LIS State Design
11
Quiz: LIS Basics
12
Lessons from LIS
13
LeetCode 300 Longest Increasing Subsequence - Binary Search Optimization
14
LeetCode 300 Longest Increasing Subsequence - Binary Search Implementation
15
LeetCode 300 Longest Increasing Subsequence - Binary Search Walkthrough
16
Why Binary Search Works
17
Quiz: LIS Optimization
18
LeetCode 673 Number of Longest Increasing Subsequences - Problem Statement
19
LeetCode 673 Number of Longest Increasing Subsequences - Dual State
20
LeetCode 673 Number of Longest Increasing Subsequences - Implementation
21
LeetCode 673 Number of Longest Increasing Subsequences - Walkthrough
22
Quiz: Counting LIS
23
LeetCode 354 Russian Doll Envelopes - Problem Statement
24
LeetCode 354 Russian Doll Envelopes - Walkthrough
25
LeetCode 1048 Longest String Chain - Problem Statement
26
LeetCode 1048 Longest String Chain - Walkthrough
27
LeetCode 368 Largest Divisible Subset - Problem Statement
28
LeetCode 368 Largest Divisible Subset - The LIS Connection
29
LeetCode 368 Largest Divisible Subset - Implementation
30
LeetCode 368 Largest Divisible Subset - Walkthrough
31
Quiz: LIS Variants
32
Maximum Sum Increasing Subsequence - Problem Statement
33
Maximum Sum Increasing Subsequence - State Change
34
Maximum Sum Increasing Subsequence - Implementation
35
Maximum Sum Increasing Subsequence - Walkthrough
36
Challenge: Max Sum IS Reconstruction
37
Longest Bitonic Subsequence - Problem Statement
38
Longest Bitonic Subsequence - Two Passes
39
Longest Bitonic Subsequence - Implementation
40
Longest Bitonic Subsequence - Walkthrough
41
Quiz: Bitonic Structure
42
Minimum Deletions for Sorted - Problem Statement
43
Minimum Deletions for Sorted - Implementation
44
Pattern - LIS Family
45
Challenge: LIS in O(n log n) Space O(n)
46
What's Next
47
Section Recap
LCS and Edit Distance
0/41
Interval DP
0/45
DP on Trees
0/43
Bitmask DP
0/42
Digit DP
0/42
Game Theory DP
0/46
Probability DP
0/44
D&C and Knuth Optimization
0/47
Convex Hull Trick
0/43
Monotonic Queue Optimization
0/45
Aliens Trick (WQS Binary Search)
0/41
Slope Trick
0/47
Broken Profile DP (Plug DP)
0/42
8.1
Intro
4 minutes
100%
Tasks
Read Unit