Loading repovive.com/roadmaps/dynamic-programming
Roadmaps
Dynamic Programming
Knapsack Variations
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
1
Intro
2
Max Value to True/False
3
LeetCode 416 Partition Equal Subset Sum - Problem Statement
4
LeetCode 416 Partition Equal Subset Sum - The Hidden Knapsack
5
LeetCode 416 Partition Equal Subset Sum - Boolean State Design
6
LeetCode 416 Partition Equal Subset Sum - Implementation
7
LeetCode 416 Partition Equal Subset Sum - Walkthrough
8
Lessons from Partition
9
Challenge: Partition Reconstruction
10
Quiz: Subset Sum Basics
11
LeetCode 494 Target Sum - Problem Statement
12
LeetCode 494 Target Sum - Converting Signs to Subsets
13
LeetCode 494 Target Sum - Implementation
14
LeetCode 494 Target Sum - Walkthrough
15
Quiz: Target Sum Transform
16
Finding One to Counting All
17
LeetCode 518 Coin Change II - Problem Statement
18
LeetCode 518 Coin Change II - Combinations vs Permutations
19
LeetCode 518 Coin Change II - Loop Order
20
LeetCode 518 Coin Change II - Implementation
21
LeetCode 518 Coin Change II - Walkthrough
22
Lessons from Counting Knapsack
23
Challenge: Combinations vs Permutations
24
Quiz: Counting in DP
25
Unlimited to Limited
26
Bounded Knapsack - Problem Statement
27
Bounded Knapsack - Why Naive Is Slow
28
Bounded Knapsack - Binary Representation
29
Bounded Knapsack - Implementation
30
Bounded Knapsack - Walkthrough
31
Quiz: Binary Splitting
32
Quiz: Knapsack Types
33
One Constraint to Two
34
LeetCode 474 Ones and Zeroes - Problem Statement
35
LeetCode 474 Ones and Zeroes - Two Capacities
36
LeetCode 474 Ones and Zeroes - Implementation
37
LeetCode 474 Ones and Zeroes - Walkthrough
38
LeetCode 1049 Last Stone Weight II - Problem Statement
39
LeetCode 1049 Last Stone Weight II - Hidden Subset Sum
40
LeetCode 1049 Last Stone Weight II - Implementation
41
LeetCode 1049 Last Stone Weight II - Walkthrough
42
Quiz: Last Stone Reduction
43
Practice - Subset Sum Count
44
What's Next
45
Pattern - Choosing the Right Variation
46
Section Recap
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
6.1
Intro
5 minutes
100%
Tasks
Read Unit