3613. 最小化最大组件成本
Medium | Binary Search, Union-Find, Graph Theory, Sorting
Union-Find
3619. 统计总价值能被 K 整除的岛屿数量
Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix
3666. 使二进制字符串相等的最少操作数
Hard | Math, String, Breadth-First Search, Union-Find, Ordered Set
3695. 使用交换最大化交替和
Hard | Array, Greedy, Union-Find, Sorting
3710. 最大分割因子
Hard | Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
3873. 通过添加一个点激活的最大点数
Hard | Array, Hash Table, Union-Find
3887. 增量偶权重环查询
Hard | Union-Find, Graph Theory
3108. 加权图中的最小费用路径
Hard | Array, Bit Manipulation, Union-Find, Graph Theory
2658. 网格中鱼的最大数目
Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix
2685. 统计完全连通分量的数量
Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
2709. 最大公约数遍历
Hard | Array, Math, Union-Find, Number Theory
2812. 在网格中找到最安全路径
Medium | Array, Binary Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix
2948. 通过交换元素使数组字典序最小
Medium | Array, Union-Find, Sorting
2003. 每个子树内缺失的最小遗传值
Hard | Array, Dynamic Programming, Tree, Depth-First Search, Union-Find
2076. 处理受限的好友请求
Hard | Union-Find, Graph Theory
2157. 字符串分组
Hard | Array, Hash Table, String, Bit Manipulation, Union-Find
2316. 统计无向图中无法互相到达的点对数
Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
2334. 元素大于变化阈值的子数组
Hard | Array, Stack, Union-Find, Monotonic Stack
2368. 有限制的可达节点数
Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
2382. 删除后的最大线段和
Hard | Array, Union-Find, Prefix Sum, Ordered Set