Tree DP problems

20 Tree DP DSA practice problems on CampusCode, each with statement, examples and constraints.

• 895. Binary Tree Maximum Path Sum Medium Trees
• 915. Longest Univalue Path Medium Trees
• 916. House Robber III — Tree DP Medium Trees
• 917. Distribute Coins in Binary Tree Medium Trees
• 924. Largest BST Subtree Medium Trees
• 936. Binary Tree Maximum Path Sum (Any to Any) Hard Trees
• 941. All Possible Full Binary Trees (Count) Hard Trees
• 942. Maximum Sum BST in Binary Tree Hard Trees
• 944. Number of Ways to Reorder Array as BST Hard Trees
• 961. Maximum Weight Independent Set on a Tree Hard Trees
• 962. Tree Diameter with Weighted Edges Hard Trees
• 963. Minimum Vertex Cover on a Tree Hard Trees
• 964. Minimum Dominating Set on a Tree Hard Trees
• 965. Sum of Distances in Tree (Rerooting) Hard Trees
• 967. Distribute Coins in Binary Tree (Minimum Moves) Hard Trees
• 1199. House Robber III — Tree DP Medium Dynamic Programming
• 1200. Diameter of Binary Tree (DP) Medium Dynamic Programming
• 1201. Maximum Independent Set on Tree Medium Dynamic Programming
• 1202. Distribute Coins in Binary Tree Medium Dynamic Programming
• 1203. Minimum Time to Collect All Apples Medium Dynamic Programming