Loading repovive.com/roadmaps/dynamic-programming
Roadmaps
Dynamic Programming
Bitmask DP
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
Interval DP
0/45
DP on Trees
0/43
Bitmask DP
0/42
1
Intro
2
Vocabulary - Bitmask
3
Bit Operations
4
Simple Example - Subset Membership
5
Iterating Subsets
6
Quiz: Bit Operations
7
The Bitmask DP Pattern
8
When Bitmask DP?
9
Quiz: When Bitmask DP
10
Subset Sum - Problem Statement
11
Subset Sum - Key Observation
12
Subset Sum - Implementation
13
Quiz: Subset Sum
14
LeetCode 1879 Minimum XOR Sum of Two Arrays - Problem Statement
15
Assignment - key observation
16
Assignment - State Design
17
Assignment - Implementation
18
Quiz: Assignment
19
Hamiltonian Flights - Problem Statement
20
TSP - key observation
21
TSP - State Design
22
TSP - Transition
23
TSP - Implementation
24
Quiz: TSP
25
LeetCode 698 Partition to K Equal Sum Subsets - Problem Statement
26
K Subsets - key observation
27
K Subsets - Implementation
28
Why Sum Over Subsets?
29
Iterating Submasks
30
SOS DP - The Core Idea
31
SOS DP - Transition
32
Quiz: SOS DP Transition
33
SOS DP - Space Optimization
34
SOS DP - Implementation
35
Bit Problem - Problem Statement
36
Bit Problem - Query Analysis
37
Bit Problem - Implementation
38
SOS DP - Superset Version
39
Quiz: SOS DP Applications
40
When to Use SOS DP
41
Lessons from Bitmask DP
42
Section Recap
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
12.1
Intro
5 minutes
100%
Tasks
Read Unit