← 所有清單
Union Find (DSU)
20 essential Union Find problems covering connected components, cycle detection, dynamic connectivity, and Kruskal's algorithm.
21 道題目
| # | 題目 | 難度 |
|---|---|---|
| 1 | Medium | |
| 2 | Medium | |
| 3 | Medium | |
| 4 | Medium | |
| 5 |
20 essential Union Find problems covering connected components, cycle detection, dynamic connectivity, and Kruskal's algorithm.
21 道題目
| # | 題目 | 難度 |
|---|---|---|
| 1 | Medium | |
| 2 | Medium | |
| 3 | Medium | |
| 4 | Medium | |
| 5 |
| Hard |
| 6 | Medium |
| 7 | Medium |
| 8 | Medium |
| 9 | Medium |
| 10 | Hard |
| 11 | Medium |
| 12 | Medium |
| 13 | Hard |
| 14 | Hard |
| 15 | Medium |
| 16 | Medium |
| 17 | Medium |
| 18 | Medium |
| 19 | Medium |
| 20 | Medium |
| 21 | Hard |