Loading repovive.com/roadmaps/dynamic-programming
Roadmaps
Dynamic Programming
Broken Profile DP (Plug 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
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
1
Intro
2
The Profile Concept
3
Quiz: Profile Concept
4
Why Bitmasks Work
5
Bitmask Encoding - Walkthrough
6
State Transitions
7
State Transitions - Walkthrough
8
Quiz: Profile Encoding
9
Counting Tilings - Problem Statement
10
Counting Tilings - State Definition
11
Counting Tilings - Filling a Column
12
Counting Tilings - Transition Formula
13
Counting Tilings - Implementation
14
Counting Tilings - Walkthrough
15
Challenge: Transition Enumeration
16
Quiz: Transition Count
17
Tri Tiling - Problem Statement
18
Tri Tiling - Small Cases
19
Tri Tiling - Recurrence Discovery
20
Tri Tiling - Implementation
21
Tri Tiling - Walkthrough
22
When Width Is Fixed
23
Quiz: Why Small Width
24
LeetCode 790 Domino and Tromino Tiling - Problem Statement
25
Domino and Tromino - Profile States
26
Domino and Tromino - Transitions
27
Domino and Tromino - Simplified Recurrence
28
Simplified Recurrence - Walkthrough
29
Domino and Tromino - Implementation
30
Domino and Tromino - Walkthrough
31
Quiz: Profile Count
32
Chessboard Coloring - Problem Statement
33
Hamiltonian Paths - Problem Statement
34
Challenge: Larger Tiles
35
When to Use Broken Profile DP
36
Pattern - Broken Profile Recognition
37
Course Conclusion
38
Complexity Analysis
39
Complexity Analysis - Walkthrough
40
Common Mistakes
41
Common Mistakes - Walkthrough
42
Section Recap
21.1
Intro
3 minutes
100%
Tasks
Read Unit