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 | 力扣

• Tags: Dynamic Programming, Tree, Depth First Search

3068. Find the Maximum Sum of Node Values

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Greedy, Bit Manipulation, Tree, Sorting

2920. Maximum Points After Collecting Coins From All Nodes

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Bit Manipulation, Tree, Depth First Search, Memoization

1916. Count Ways to Build Rooms in an Ant Colony

• LeetCode | 力扣

• Tags: Math, Dynamic Programming, Tree, Graph, Topological Sort, Combinatorics

3367. Maximize Sum of Weights after Edge Removals

• LeetCode | 力扣

• Tags: Dynamic Programming, Tree, Depth First Search

2313. Minimum Flips in Binary Tree to Get Result 👑

• LeetCode | 力扣

• Tags: Dynamic Programming, Tree, Depth First Search, Binary Tree