994. 腐烂的橘子
Medium | Array, Breadth-First Search, Matrix
Breadth-First Search
3203. 合并两棵树后的最小直径
Hard | Tree, Depth-First Search, Breadth-First Search, Graph Theory
3235. 检查矩形角落是否可达
Hard | Array, Math, Depth-First Search, Breadth-First Search, Union-Find, Geometry
3243. 道路查询后的最短距离 I
Medium | Array, Breadth-First Search, Graph Theory
3283. 击杀所有兵的最大移动次数
Hard | Array, Math, Bit Manipulation, Breadth-First Search, Game Theory, Bitmask
3286. 在网格中寻找安全路径
Medium | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
3310. 移除项目中的方法
Medium | Depth-First Search, Breadth-First Search, Graph Theory
3372. 连接树后最大化目标节点数 I
Medium | Tree, Depth-First Search, Breadth-First Search
3373. 连接树后可到达目标节点的最大数目 II
Hard | Tree, Depth-First Search, Breadth-First Search
3376. 打破锁的最少时间 I
Medium | Array, Dynamic Programming, Backtracking, Bit Manipulation, Breadth-First Search, Bitmask