2646. 最小化旅行的价格总和
Hard | Array, Dynamic Programming, Tree, Depth-First Search, Graph Theory
Depth-First Search
2658. 网格中鱼的最大数目
Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix
2685. 统计完全连通分量的数量
Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
2846. 树中边权重均衡查询的最小操作数
Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search
2858. 最少边反转次数使每个节点都可达
Hard | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory
2867. 树中的有效路径数目
Hard | Math, Dynamic Programming, Tree, Depth-First Search, Number Theory
2872. K 可整除组件的最大数量
Hard | Tree, Depth-First Search
2876. 统计有向图中被访问的节点数
Hard | Dynamic Programming, Depth-First Search, Graph Theory, Topological Sort, Memoization
2920. 收集所有节点硬币后的最大得分
Hard | Array, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Memoization
2925. 对树进行操作后的最大得分
Medium | Dynamic Programming, Tree, Depth-First Search