面试场景
高频考察问题建模、边界条件与口头表达的清晰度。
常见误区
只背模板不解释为什么，容易在追问里失分。
练习策略
每轮练 3-5 题，固定复盘复杂度和可替代解法。
推荐练习顺序
#题目难度分类
1489
找到最小生成树里的关键边和伪关键边
Identify critical and pseudo-critical edges in a weighted graph's minimum spanning tree using Union Find efficiently.
困难
并查集
1568使陆地分离的最少天数
Find the minimum number of days to disconnect an island in a grid using depth-first search.
困难
数组
2846边权重均等查询
Find the minimum number of operations to equalize edge weights in a tree between given pairs of nodes.
困难
数组