Loading repovive.com/roadmaps/dp-problem-solving
Roadmaps
Dynamic Programming: Problem Solving
Premium
String DP
Problemset
Discussion
AI Helper
Getting Started
0/4
Knapsack
0/56
Interval DP
0/38
DP on Trees
0/44
Bitmask DP
0/50
String DP
0/38
1
Introduction to String DP
2
When to Use String DP
3
Problem - Regex Matching
4
Regex Matching - Why Naive Fails
5
Regex Matching - Defining the DP
6
Regex Matching - Transition
7
Regex Matching - Base Cases
8
Regex Matching - Implementation
9
Regex Matching - Time and Space
10
Regex Matching - Edge Cases
11
Lessons from Regex Matching
12
Problem - Interleaving String
13
Interleaving String - Why DP?
14
Interleaving String - Solution
15
Interleaving String - Building the State
16
Problem - Palindrome Partitioning
17
Palindrome Partitioning - Solution
18
Palindrome Partitioning - Precomputation
19
SCS - Solution
20
SCS - Reconstruction
21
Problem - Longest Palindromic Substring
22
Longest Palindromic Substring - Solution
23
Problem - Word Break
24
Word Break - Solution
25
Quiz: String DP Patterns
26
Quiz: String DP Edge Cases
27
Common Mistakes in String DP
28
Problem - Scramble String
29
Scramble String - Implementation
30
Problem - Count Different Palindromic Subsequences
31
Count Different Palindromic Subsequences - Implementation
32
Problem - Distinct Subsequences II
33
Distinct Subsequences II - Implementation
34
Problem - Palindrome Partitioning III
35
Palindrome Partitioning III - Implementation
36
Problem - Number of Ways to Form Target String
37
Number of Ways to Form Target String - Implementation
38
Section Recap
Game Theory DP
0/44
Digit DP
0/58
6.1
Introduction to String DP
2 minutes
100%
Premium Roadmap
You're previewing free content. Unlock all units to continue learning.
Subscribe
Tasks
Read Unit