1Number of ProvincesMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 2Number of ProvincesMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 3Course Schedule IIMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 4Number of ProvincesMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 5Course Schedule IIMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 6Find if Path Exists in GraphEasyDepth-First SearchBreadth-First SearchUnion-Find
Solve → 7Redundant ConnectionMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 8Course ScheduleMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 9Lexicographical NumbersMediumDepth-First SearchTrie
Solve → 10Number of ProvincesMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 11Course Schedule IIMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 12Find Eventual Safe StatesMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 13Redundant ConnectionMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 14Critical Connections in a NetworkHardDepth-First SearchGraph TheoryBiconnected Component
Solve → 15Find if Path Exists in GraphEasyDepth-First SearchBreadth-First SearchUnion-Find
Solve → 16Network Delay TimeMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 17Minimum Height TreesMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 18Minimum Score of a Path Between Two CitiesMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 19Flower Planting With No AdjacentMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 20Remove Methods From ProjectMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 21Find Closest Node to Given Two NodesMediumDepth-First SearchGraph Theory
Solve → 22Number of Operations to Make Network ConnectedMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 23Is Graph Bipartite?MediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 24Sort Items by Groups Respecting DependenciesHardDepth-First SearchBreadth-First SearchGraph Theory
Solve → 25Number of ProvincesMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 26Lexicographical NumbersMediumDepth-First SearchTrie
Solve → 27Course ScheduleMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 28Course Schedule IIMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 29Redundant ConnectionMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 30Find Eventual Safe StatesMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 31Find if Path Exists in GraphEasyDepth-First SearchBreadth-First SearchUnion-Find
Solve → 32Critical Connections in a NetworkHardDepth-First SearchGraph TheoryBiconnected Component
Solve → 33Network Delay TimeMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 34Minimum Height TreesMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 35Number of Operations to Make Network ConnectedMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 36Minimum Score of a Path Between Two CitiesMediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 37Is Graph Bipartite?MediumDepth-First SearchBreadth-First SearchUnion-Find
Solve → 38Flower Planting With No AdjacentMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 39Remove Methods From ProjectMediumDepth-First SearchBreadth-First SearchGraph Theory
Solve → 40Find Closest Node to Given Two NodesMediumDepth-First SearchGraph Theory
Solve → 41Sort Items by Groups Respecting DependenciesHardDepth-First SearchBreadth-First SearchGraph Theory
Solve →