1Course ScheduleMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 2Number of Operations to Make Network ConnectedMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 3Course ScheduleMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 4Course Schedule IIMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 5Critical Connections in a NetworkHardDepth-First SearchGraph TheoryBiconnected Component
Solve → 6Number of Operations to Make Network ConnectedMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 7Number of ProvincesMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 8Find if Path Exists in GraphEasyDepth-First SearchBreadth-First SearchUnion-Find
Solve → 9Minimum Height TreesMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 10Course ScheduleMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 11Course Schedule IIMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 12Number of ProvincesMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 13Number of Operations to Make Network ConnectedMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 14Find if Path Exists in GraphEasyDepth-First SearchBreadth-First SearchUnion-Find
Solve → 15Critical Connections in a NetworkHardDepth-First SearchGraph TheoryBiconnected Component
Solve → 16Network Delay TimeMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 17Find Eventual Safe StatesMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 18Redundant ConnectionMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 19Is Graph Bipartite?MediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 20Possible BipartitionMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 21Find Closest Node to Given Two NodesMediumDepth-First SearchGraph Theory
Solve → 22Minimum Height TreesMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 23Lexicographical NumbersMediumDepth-First SearchTrie
Solve → 24Course ScheduleMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 25Course Schedule IIMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 26Number of ProvincesMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 27Number of Connected Components in an Undirected GraphMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 28Is Graph Bipartite?MediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 29Critical Connections in a NetworkHardDepth-First SearchGraph TheoryBiconnected Component
Solve → 30Find Eventual Safe StatesMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 31Keys and RoomsMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 32Nested List Weight SumMediumDepth-First SearchBreadth-First Search
Solve → 33Reorder Routes to Make All Paths Lead to the City ZeroMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 34Lexicographical NumbersMediumDepth-First SearchTrie
Solve → 35Redundant ConnectionMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 36Course Schedule IVMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 37Network Delay TimeMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 38Find if Path Exists in GraphEasyDepth-First SearchBreadth-First SearchUnion-Find
Solve → 39Minimum Height TreesMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 40Number of Operations to Make Network ConnectedMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 41Count the Number of Complete ComponentsMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 42Count Unreachable Pairs of Nodes in an Undirected GraphMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 43Possible BipartitionMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 44All Ancestors of a Node in a Directed Acyclic GraphMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 45Graph Valid TreeMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 46Longest Cycle in a GraphHardDepth-First SearchBreadth-First SearchGraph Theory
Solve → 47Divide Nodes Into the Maximum Number of GroupsHardDepth-First SearchBreadth-First SearchUnion-Find
Solve → 48Find Closest Node to Given Two NodesMediumDepth-First SearchGraph Theory
Solve → 49Minimum Score of a Path Between Two CitiesMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 50Sort Items by Groups Respecting DependenciesHardDepth-First SearchBreadth-First SearchGraph Theory
Solve → 51Find All People With SecretHardDepth-First SearchBreadth-First SearchUnion-Find
Solve → 52Course ScheduleMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 53Course Schedule IIMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 54Number of ProvincesMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 55Critical Connections in a NetworkHardDepth-First SearchGraph TheoryBiconnected Component
Solve → 56Is Graph Bipartite?MediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 57Number of Connected Components in an Undirected GraphMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 58Find Eventual Safe StatesMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 59Count Unreachable Pairs of Nodes in an Undirected GraphMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 60Keys and RoomsMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 61Find if Path Exists in GraphEasyDepth-First SearchBreadth-First SearchUnion-Find
Solve → 62Redundant ConnectionMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 63Network Delay TimeMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 64Number of Operations to Make Network ConnectedMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 65Nested List Weight SumMediumDepth-First SearchBreadth-First Search
Solve → 66Lexicographical NumbersMediumDepth-First SearchTrie
Solve → 67Reorder Routes to Make All Paths Lead to the City ZeroMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 68Course Schedule IVMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 69Minimum Height TreesMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 70Possible BipartitionMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 71Count the Number of Complete ComponentsMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 72Find Closest Node to Given Two NodesMediumDepth-First SearchGraph Theory
Solve → 73All Ancestors of a Node in a Directed Acyclic GraphMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 74Graph Valid TreeMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 75Longest Cycle in a GraphHardDepth-First SearchBreadth-First SearchGraph Theory
Solve → 76Divide Nodes Into the Maximum Number of GroupsHardDepth-First SearchBreadth-First SearchUnion-Find
Solve → 77Find All People With SecretHardDepth-First SearchBreadth-First SearchUnion-Find
Solve → 78Minimum Score of a Path Between Two CitiesMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 79Sort Items by Groups Respecting DependenciesHardDepth-First SearchBreadth-First SearchGraph Theory
Solve →