β’PRACTICE
Topological Sort Interview Questions
6 Topological Sort problems asked across FAANG and top tech companies. Approach hints, optimal solutions, and related problems.
Filter by company
Clear all βFilter by topic
Array (178)Backtracking (17)BFS (23)Binary Search (34)Binary Tree (13)Bit Manipulation (16)Breadth-First Search (20)Counting (7)Data Stream (6)Database (6)Depth-First Search (27)Design (37)DFS (24)Divide and Conquer (7)Doubly-Linked List (5)DP (10)Dynamic Programming (39)Graph (6)Graph Theory (13)Greedy (31)Hash Table (87)Heap (12)Heap (Priority Queue) (13)Linked List (15)Math (32)Matrix (22)Monotonic Stack (6)Ordered Set (8)Prefix Sum (11)Queue (10)Recursion (7)Simulation (11)Sliding Window (21)Sorting (45)Stack (24)String (85)Topological Sort (6)Tree (30)Trie (10)Two Pointers (30)Union-Find (13)
π
to save your progress.
| β 0 | Problem | Difficulty | Companies | Breakdown / Solution | LeetCode |
|---|---|---|---|---|---|
| Course Schedule II | Medium | 5 companies | View breakdown β | ||
| Course Schedule | Medium | 4 companies | View breakdown β | ||
| Alien Dictionary | Hard | 6 companies | View breakdown β | ||
| Distance to a Cycle in Undirected Graph | Hard | 1 companies | View breakdown β | ||
| Find Eventual Safe States | MEDIUM | 1 companies | View breakdown β | ||
| Parallel Courses | MEDIUM | 1 companies | View breakdown β |
Practice with a Mock Interview
Solve these Topological Sort problems under real interview pressure with our AI interviewer.
Start Mock Interview β