1631. 最小体力消耗路径
Medium | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix
Union-Find
2092. 寻找拥有秘密的所有人
Hard | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Sorting
1267. 统计参与通信的服务器
Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix, Counting
1489. 找到最小生成树里的关键边和伪关键边
Hard | Union-Find, Graph Theory, Sorting, Minimum Spanning Tree, Strongly Connected Component
1559. 检测二维网格中的环
Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix
1579. 保持图可完全遍历的最多删除边数
Hard | Union-Find, Graph Theory
547. 省份数量
Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
695. 岛屿的最大面积
Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix
785. 判断二分图
Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
827. 最大人工岛
Hard | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix
839. 相似字符串组
Hard | Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find
886. 可能的二分图
Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
959. 由斜杠分割的区域
Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Matrix
3235. 检查矩形角落是否可达
Hard | Array, Math, Depth-First Search, Breadth-First Search, Union-Find, Geometry
3378. LCM 图中的连通分量数目
Hard | Array, Hash Table, Math, Union-Find, Number Theory
3493. 属性图
Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
3532. 图中路径存在性查询 I
Medium | Array, Hash Table, Binary Search, Union-Find, Graph Theory
3600. 通过升级最大化生成树稳定性
Hard | Binary Search, Greedy, Union-Find, Graph Theory, Minimum Spanning Tree
3607. 电网维护
Medium | Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Heap (Priority Queue), Ordered Set
3608. K个连通分量的最小时间
Medium | Binary Search, Union-Find, Graph Theory, Sorting