GL
GrindLens
PatternsSheetsPricingQuestions
  1. Home
  2. /Patterns
  3. /Topological Sort
←All Patterns
GraphsEvidence Contributing

Topological Sort

Order nodes of a DAG so every directed edge points from earlier to later, via DFS post-order or Kahn's algorithm.

Practice Problems: 3
Difficulty: 0 Easy·2 Medium·1 Hard

Core technique

Review the technique, then try the mapped problems below. The right approach depends on each problem's constraints.

  • Core Strategy: Order nodes of a DAG so every directed edge points from earlier to later, via DFS post-order or Kahn's algorithm.

Canonical Practice Problems

3 problems
1.Course ScheduleMedium
Solve on LeetCode↗
2.Course Schedule IIMedium
Solve on LeetCode↗
3.Alien DictionaryHard
Solve on LeetCode↗

Curated Sheets Containing This Pattern

NeetCode 150

3 problems

→

NeetCode All

3 problems

→

Striver A2Z

3 problems

→

Blind 75

2 problems

→

LeetCode Top Interview 150

2 problems

→

Striver SDE Sheet

1 problem

→

Related Algorithmic Patterns

Graphs

BFS Shortest Path (Unweighted)

Graphs

Bounded-Hop Shortest Path (Bellman-Ford Style)

Graphs

Dijkstra's Shortest Path

Graphs

Flood Fill

Graphs

Graph DFS Traversal

GL
GrindLens

Precision pattern analytics and curated sheet tracking for algorithmic coding interview preparation.

Quick lookup:⌘Kor/

Platform

  • Patterns→
  • Sheets→
  • Pricing→

Community

  • Feedback
  • Report a bug
  • X
  • LinkedIn

© 2026 GrindLens. LeetCode is a trademark of LeetCode. GrindLens is an independent analytics platform and is not affiliated with or endorsed by LeetCode.

Terms of ServicePrivacy Policy