3367. 边删除后权重和的最大值
Hard | Dynamic Programming, Tree, Depth-First Search, Sorting
Tree
3372. 连接树后最大化目标节点数 I
Medium | Tree, Depth-First Search, Breadth-First Search
3373. 连接树后可到达目标节点的最大数目 II
Hard | Tree, Depth-First Search, Breadth-First Search
3425. 最长特殊路径
Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sum
3486. 最长特殊路径 II
Hard | Array, Hash Table, Tree, Depth-First Search, Prefix Sum
3544. 子树反转和
Hard | Array, Dynamic Programming, Tree, Depth-First Search
3553. 带权重子图的最小路径 II
Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search
3558. 分配边权重的方案数 I
Medium | Math, Tree, Depth-First Search
3559. 边权重分配的方案数II
Hard | Array, Math, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search
3562. 股票交易折扣的最大利润
Hard | Array, Dynamic Programming, Tree, Depth-First Search