Tree DP Maximum Independent Set¶
Table of Contents¶
- 337. House Robber III (Medium)
- 2646. Minimize the Total Price of the Trips (Hard)
- 2378. Choose Edges to Maximize Score in a Tree (Medium) 👑
337. House Robber III¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: dynamic programming, tree, depth first search, binary tree
2646. Minimize the Total Price of the Trips¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, tree, depth first search, graph
2378. Choose Edges to Maximize Score in a Tree¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: dynamic programming, tree, depth first search