DP on Trees
Computing an answer for a node from its children, which is DP wearing recursion.
0 of 22 answered
Start here
Counting the Subtrees That Agree
Foundation
- Not triedCounting the Subtrees That AgreeFoundation
- Not triedCutting One Edge for the Largest ProductFoundation
- Not triedThe Heaviest SubtreeFoundation
- Not triedWhat a node holdsFoundation
- Not triedWhat the tree structure buysFoundation
- Not triedWhy a node often needs two numbersFoundation
- Not triedWhy a tree is computed from the bottomFoundation
- Not triedAdding Up Every Pair DistanceCore
- Not triedCollecting Every Apple and Coming BackCore
- Not triedCutting a Tree Into Even PiecesCore
- Not triedFewest Nodes to Guard Every EdgeCore
- Not triedHow Many Sets Have No Two NeighboursCore
- Not triedRemoving the Node That Splits It BestCore
- Not triedThe Best Set With No Two NeighboursCore
- Not triedThe longest path in a treeCore
- Not triedThe Longest Rising Chain DownwardsCore
- Not triedThe Most Edges With No Shared EndpointCore
- Not triedAnswering for every rootChallenge
- Not triedDP on a treeChallenge
- Not triedFewest Cameras to Watch EverythingChallenge
- Not triedThe Best Place to StandChallenge
- Not triedThe Longest Path With No Repeat Next DoorChallenge