Blind 75 · Topological Sort
Order nodes of a DAG so every directed edge points from earlier to later, via DFS post-order or Kahn's algorithm.
Sheet Problems: 2
Category: Graphs
ℹ
Curated selection from Blind 75
This sheet features 2 problems testing this technique. For the complete collection of problems and detailed algorithmic intuition, visit the Topological Sort Pattern Guide.
Featured Problems (2)
Explore More Patterns in Blind 75
Track your progress across all 75 problems in this curriculum roadmap.