Loading repovive.com/roadmaps/dynamic-programming
Roadmaps
Dynamic Programming
Knapsack
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
1
Intro
2
0/1 Knapsack - Problem Statement
3
0/1 Knapsack - Why Greedy Fails
4
0/1 Knapsack - State Design
5
0/1 Knapsack - Base Cases
6
0/1 Knapsack - Transition
7
0/1 Knapsack - Final Answer
8
0/1 Knapsack - Implementation
9
0/1 Knapsack - Walkthrough
10
Lessons from 0/1 Knapsack
11
Challenge: Reconstruct Items
12
Quiz: 0/1 Knapsack Concepts
13
Applying 0/1 Knapsack
14
Weight-Based to Value-Based
15
Knapsack 2 - Problem Statement
16
Knapsack 2 - Why Weight-Based DP Fails
17
Knapsack 2 - The Observation
18
Knapsack 2 - State Design
19
Knapsack 2 - Transition
20
Knapsack 2 - Implementation
21
Knapsack 2 - Walkthrough
22
Lessons from Value-Based Knapsack
23
Quiz: When to Use Value-Based
24
Quiz: Knapsack State Design
25
0/1 to Unbounded
26
Unbounded Knapsack - Problem Statement
27
Unbounded Knapsack - State Design
28
Unbounded Knapsack - Transition
29
Unbounded Knapsack - Implementation
30
Unbounded Knapsack - Walkthrough
31
Lessons from Unbounded Knapsack
32
Quiz: 0/1 vs Unbounded
33
LeetCode 322 Coin Change - Problem Statement
34
LeetCode 322 Coin Change - Walkthrough
35
Quiz: Knapsack Variations
36
Pattern - Knapsack DP
37
Book Shop - Problem Statement
38
Book Shop - Recognizing the Pattern
39
Book Shop - State Design
40
Book Shop - Walkthrough
41
Book Shop - Implementation
42
What's Next
43
Section Recap
Knapsack Variations
0/46
Prefix Sums
0/44
Longest Increasing Subsequence
0/47
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
5.1
Intro
4 minutes
100%
Tasks
Read Unit