2858. 最少边反转次数使每个节点都可达
Hard | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory
Hard | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory
Medium | Array, Math, Depth-First Search, Breadth-First Search, Graph Theory, Geometry
Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort
Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path
Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
Hard | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix
Hard | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort
Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree
Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree