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