Tree DP Other¶
Table of Contents¶
- 2925. Maximum Score After Applying Operations on a Tree (Medium)
- 3068. Find the Maximum Sum of Node Values (Hard)
- 2920. Maximum Points After Collecting Coins From All Nodes (Hard)
- 1916. Count Ways to Build Rooms in an Ant Colony (Hard)
- 3367. Maximize Sum of Weights after Edge Removals (Hard)
- 2313. Minimum Flips in Binary Tree to Get Result (Hard) 👑
2925. Maximum Score After Applying Operations on a Tree¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: dynamic programming, tree, depth first search
3068. Find the Maximum Sum of Node Values¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, greedy, bit manipulation, tree, sorting
2920. Maximum Points After Collecting Coins From All Nodes¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, bit manipulation, tree, depth first search, memoization
1916. Count Ways to Build Rooms in an Ant Colony¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: math, dynamic programming, tree, graph, topological sort, combinatorics
3367. Maximize Sum of Weights after Edge Removals¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: dynamic programming, tree, depth first search
2313. Minimum Flips in Binary Tree to Get Result¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: dynamic programming, tree, depth first search, binary tree