Topological Sort problems

15 Topological Sort DSA practice problems on CampusCode, each with statement, examples and constraints.

• 1012. Topological Sort Using DFS Easy Graphs
• 1013. Topological Sort Using Kahn's Algorithm (BFS) Easy Graphs
• 1014. Check if a Directed Graph is a DAG Easy Graphs
• 1015. Course Schedule I — Can Finish All Courses Easy Graphs
• 1028. Shortest Path in DAG (Topo + Relax) Medium Graphs
• 1041. Course Schedule II — Return Order Medium Graphs
• 1042. Alien Dictionary — Find Letter Order Medium Graphs
• 1043. Find All Ancestors of a Node in DAG Medium Graphs
• 1044. Parallel Courses — Minimum Semesters Medium Graphs
• 1045. Sequence Reconstruction Using Topo Sort Medium Graphs
• 1088. Minimum Height Trees — Topological Trim Hard Graphs
• 1089. Parallel Courses III — Maximum Time with Dependencies Hard Graphs
• 1103. Course Schedule IV — Reachability Queries Hard Graphs
• 1114. Minimum Equivalent Graph via Transitive Reduction Hard Graphs
• 1385. Parallel Courses III — Bitmask Scheduling Hard Bit Manipulation