Loading repovive.com/roadmaps/dynamic-programming
Roadmaps
Dynamic Programming
LCS and Edit Distance
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
LCS and Edit Distance
0/41
1
Intro
2
Two-Dimensional State
3
LeetCode 1143 Longest Common Subsequence - Problem Statement
4
LeetCode 1143 Longest Common Subsequence - State Design
5
LeetCode 1143 Longest Common Subsequence - Transition
6
LeetCode 1143 Longest Common Subsequence - Implementation
7
LeetCode 1143 Longest Common Subsequence - Walkthrough
8
Quiz: LCS Concepts
9
LeetCode 1143 Longest Common Subsequence - Reconstruction
10
Lessons from LCS
11
Challenge: LCS Space Optimization
12
LeetCode 712 Minimum ASCII Delete Sum for Two Strings - Problem Statement
13
LeetCode 712 Minimum ASCII Delete Sum for Two Strings - Weighted DP
14
LeetCode 712 Minimum ASCII Delete Sum for Two Strings - Implementation
15
LeetCode 712 Minimum ASCII Delete Sum for Two Strings - Walkthrough
16
LeetCode 72 Edit Distance - Problem Statement
17
LeetCode 72 Edit Distance - Operations
18
LeetCode 72 Edit Distance - State Design
19
LeetCode 72 Edit Distance - Transition
20
LeetCode 72 Edit Distance - Implementation
21
LeetCode 72 Edit Distance - Walkthrough
22
Challenge: Edit Distance Reconstruction
23
Quiz: Edit Distance
24
Lessons from Edit Distance
25
Pattern - String DP
26
LeetCode 516 Longest Palindromic Subsequence - Problem Statement
27
LeetCode 516 Longest Palindromic Subsequence - Walkthrough
28
LeetCode 583 Delete Operation for Two Strings - Problem Statement
29
LeetCode 115 Distinct Subsequences - Problem Statement
30
LeetCode 115 Distinct Subsequences - Walkthrough
31
Quiz: String DP Patterns
32
LeetCode 1092 Shortest Common Supersequence - Problem Statement
33
LeetCode 1092 Shortest Common Supersequence - The LCS Connection
34
LeetCode 1092 Shortest Common Supersequence - Implementation
35
LeetCode 1092 Shortest Common Supersequence - Walkthrough
36
LeetCode 44 Wildcard Matching - Problem Statement
37
LeetCode 44 Wildcard Matching - State Design
38
LeetCode 44 Wildcard Matching - Implementation
39
LeetCode 44 Wildcard Matching - Walkthrough
40
What's Next
41
Section Recap
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
9.1
Intro
4 minutes
100%
Tasks
Read Unit