2458. 移除子树后的二叉树高度
Hard | Array, Tree, Depth-First Search, Breadth-First Search, Binary Tree
Breadth-First Search
2467. 树中最大收益路径
Medium | Array, Tree, Depth-First Search, Breadth-First Search, Graph Theory
2471. 按层排序二叉树所需的最少操作数
Medium | Tree, Breadth-First Search, Binary Tree
2477. 到达首都的最少燃料成本
Medium | Tree, Depth-First Search, Breadth-First Search, Graph Theory
2492. 两座城市间路径的最小分数
Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
2493. 将节点分成最多的组数
Hard | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
2503. 网格查询的最大得分
Hard | Array, Two Pointers, Breadth-First Search, Union-Find, Sorting, Heap (Priority Queue), Matrix
2556. 最多翻转一次使二进制矩阵不连通
Medium | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Matrix
2577. 访问网格中单元格的最短时间
Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
2583. 二叉树中的第K大层和
Medium | Tree, Breadth-First Search, Sorting, Binary Tree