1761. 图中连通三元组的最小度数
Hard | Graph Theory, Enumeration
Hard | Graph Theory, Enumeration
Hard | Array, Hash Table, Two Pointers, Binary Search, Graph Theory, Sorting, Counting
Medium | Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Path
Easy | Graph Theory
Hard | Hash Table, String, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Counting
Hard | Array, Dynamic Programming, Graph Theory
Easy | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory
Medium | Depth-First Search, Breadth-First Search, Graph Theory
Hard | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort
Medium | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path