1315. 祖父节点值为偶数的节点和
Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree
Breadth-First Search
1319. 连通网络的操作次数
Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
1345. 跳跃游戏 IV
Hard | Array, Hash Table, Breadth-First Search
1361. 验证二叉树
Medium | Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Binary Tree
1368. 使网格中至少有一条有效路径的最小代价
Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
1376. 通知所有员工所需的时间
Medium | Tree, Depth-First Search, Breadth-First Search
1377. 青蛙位置
Hard | Tree, Depth-First Search, Breadth-First Search, Graph Theory
1379. 在二叉树的克隆中找到对应节点
Easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree
1391. 检查网格中是否存在有效路径
Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix
1448. 统计二叉树中好节点的数目
Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree