Graphs • Intermediate • 25 min
Course Schedule
How to turn prerequisites into a directed graph and detect when a dependency comes back to itself.
Practice problems with walkthroughs, hints, and solutions.
Filter by type or level
Graphs • Intermediate • 25 min
How to turn prerequisites into a directed graph and detect when a dependency comes back to itself.
Graphs • Intermediate • 20 min
How to deep-copy a graph with cycles by keeping a clear mapping from old nodes to new ones.
Graphs • Advanced • 30 min
How to extract letter constraints from sorted words and turn them into a [topological sort](/glossary/topological-sort).