Tree Dp Pattern

Master the Tree Dp coding pattern with curated problems.

#	Title	Difficulty	Topics
2313	Minimum Flips in Binary Tree to Get Result	Hard	dynamic programming
2378	Choose Edges to Maximize Score in a Tree	Medium	dynamic programming
2385	Amount of Time for Binary Tree to Be Infected	Medium	depth first search
2538	Difference Between Maximum and Minimum Price Sum	Hard	dynamic programming
2646	Minimize the Total Price of the Trips	Hard	dynamic programming
2858	Minimum Edge Reversals So Every Node Is Reachable	Hard	dynamic programming
2867	Count Valid Paths in a Tree	Hard	dynamic programming
2920	Maximum Points After Collecting Coins From All Nodes	Hard	dynamic programming
2925	Maximum Score After Applying Operations on a Tree	Medium	dynamic programming
3203	Find Minimum Diameter After Merging Two Trees	Hard	depth first search
3241	Time Taken to Mark All Nodes	Hard	dynamic programming
3313	Find the Last Marked Nodes in Tree	Hard	dynamic programming
3372	Maximize the Number of Target Nodes After Connecting Trees I	Medium	dynamic programming
3544	Subtree Inversion Sum	Hard	dynamic programming
3562	Maximum Profit from Trading Stocks with Discounts	Hard	dynamic programming
3575	Maximum Good Subtree Score	Hard	dynamic programming
3772	Maximum Subgraph Score in a Tree	Hard	dynamic programming
3939	Count Non Adjacent Subsets in a Rooted Tree	Hard	dynamic programming
3949	Subtree Inversion Sum II	Hard	dynamic programming
3965	Finish Time of Tasks I	Medium	dynamic programming
3967	Finish Time of Tasks II	Hard	dynamic programming