Loading repovive.com/roadmaps/dynamic-programming
Roadmaps
Dynamic Programming
DP on Trees
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
1
Intro
2
Vocabulary - Subtree
3
The Tree DP Pattern
4
Why Post-Order?
5
Quiz: Tree DP Basics
6
Tree Diameter - Problem Statement
7
Tree Diameter - Key Observation
8
Tree Diameter - State Design
9
Tree Diameter - Implementation
10
Tree Diameter - Walkthrough
11
Challenge: Finding the Actual Path
12
Quiz: Tree Diameter
13
LeetCode 337 House Robber III - Problem Statement
14
LeetCode 337 House Robber III - Key Observation
15
LeetCode 337 House Robber III - State Design
16
LeetCode 337 House Robber III - Implementation
17
LeetCode 337 House Robber III - Walkthrough
18
Challenge: Three States
19
Quiz: House Robber III
20
Rerooting Technique
21
LeetCode 834 Sum of Distances in Tree - Problem Statement
22
LeetCode 834 Sum of Distances in Tree - Key Observation
23
LeetCode 834 Sum of Distances in Tree - Two Passes
24
LeetCode 834 Sum of Distances in Tree - Implementation
25
LeetCode 834 Sum of Distances in Tree - Walkthrough
26
Quiz: Rerooting Complexity
27
LeetCode 124 Binary Tree Maximum Path Sum - Problem Statement
28
LeetCode 124 Binary Tree Maximum Path Sum - Implementation
29
Quiz: Maximum Path Sum
30
LeetCode 310 Minimum Height Trees - Problem Statement
31
LeetCode 310 Minimum Height Trees - Implementation
32
LeetCode 1448 Count Good Nodes in Binary Tree - Problem Statement
33
LeetCode 1448 Count Good Nodes in Binary Tree - Implementation
34
Quiz: Top-Down vs Bottom-Up
35
LeetCode 968 Binary Tree Cameras - Problem Statement
36
LeetCode 968 Binary Tree Cameras - State Transitions
37
LeetCode 968 Binary Tree Cameras - Implementation
38
Quiz: Tree Cameras Intuition
39
Pattern - Tree DP State Design
40
Challenge: DP on DAGs
41
Challenge: Tree DP with Queries
42
What's Next
43
Section Recap
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
11.1
Intro
5 minutes
100%
Tasks
Read Unit