← Back to Oracle

Depth-First Search

14 questions

1Course ScheduleMedium
Depth-First SearchBreadth-First SearchGraph Theory
Solve →
2Distance to a Cycle in Undirected GraphHard
Depth-First SearchBreadth-First SearchGraph Theory
Solve →
3Course ScheduleMedium
Depth-First SearchBreadth-First SearchGraph Theory
Solve →
4Course Schedule IIMedium
Depth-First SearchBreadth-First SearchGraph Theory
Solve →
5Keys and RoomsMedium
Depth-First SearchBreadth-First SearchGraph Theory
Solve →
6All Ancestors of a Node in a Directed Acyclic GraphMedium
Depth-First SearchBreadth-First SearchGraph Theory
Solve →
7Nested List Weight SumMedium
Depth-First SearchBreadth-First Search
Solve →
8All Ancestors of a Node in a Directed Acyclic GraphMedium
Depth-First SearchBreadth-First SearchGraph Theory
Solve →
9Course ScheduleMedium
Depth-First SearchBreadth-First SearchGraph Theory
Solve →
10Course Schedule IIMedium
Depth-First SearchBreadth-First SearchGraph Theory
Solve →
11Keys and RoomsMedium
Depth-First SearchBreadth-First SearchGraph Theory
Solve →
12Distance to a Cycle in Undirected GraphHard
Depth-First SearchBreadth-First SearchGraph Theory
Solve →
13Nested List Weight SumMedium
Depth-First SearchBreadth-First Search
Solve →
14Redundant ConnectionMedium
Depth-First SearchBreadth-First SearchUnion-Find
Solve →