Topological Sort Interview Questions
Master 34 topological sort problems frequently asked in technical interviews. These questions test your understanding of topological sortconcepts and are essential for coding interview success.
34
Total Problems
0
Easy
15
Medium
19
Hard
#269HardFrequency: 95.2%
Alien Dictionary
#1
Rank
#329HardFrequency: 92.5%
Longest Increasing Path in a Matrix
#2
Rank
#210MediumFrequency: 85.9%
Course Schedule II
#3
Rank
#207MediumFrequency: 82.3%
Course Schedule
#4
Rank
#631HardFrequency: 78.6%
Design Excel Sum Formula
#5
Rank
#1431MediumFrequency: 53.4%
All Ancestors of a Node in a Directed Acyclic Graph
#6
Rank
#881MediumFrequency: 50.3%
Loud and Rich
#7
Rank
#1101MediumFrequency: 47.5%
Parallel Courses
#8
Rank
#1558MediumFrequency: 47.5%
Course Schedule IV
#9
Rank
#2364HardFrequency: 44.8%
Longest Path With Different Adjacent Characters
#10
Rank
#3825MediumFrequency: 42.7%
Apply Substitutions
#11
Rank
#12
Rank
#2220MediumFrequency: 39.1%
Find All Possible Recipes from Given Supplies
#13
Rank
#1177MediumFrequency: 39.1%
Tree Diameter
#14
Rank
#820MediumFrequency: 35.1%
Find Eventual Safe States
#15
Rank
#1347HardFrequency: 33.3%
Distance to a Cycle in Undirected Graph
#16
Rank
#444MediumFrequency: 31.8%
Sequence Reconstruction
#17
Rank
#310MediumFrequency: 30.4%
Minimum Height Trees
#18
Rank
#2246HardFrequency: 29.3%
Maximum Employees to Be Invited to a Meeting
#19
Rank
#2176HardFrequency: 24.6%
Parallel Courses III
#20
Rank
#2090MediumFrequency: 24.4%
Number of Ways to Arrive at Destination
#21
Rank
#949HardFrequency: 22.1%
Cat and Mouse
#22
Rank
#1257HardFrequency: 22.1%
Rank Transform of a Matrix
#23
Rank
#1727HardFrequency: 20.9%
Cat and Mouse II
#24
Rank
#1912MediumFrequency: 20.9%
Number of Restricted Paths From First to Last Node
#25
Rank
#1986HardFrequency: 20.9%
Largest Color Value in a Directed Graph
#26
Rank
#2472HardFrequency: 20.9%
Build a Matrix With Conditions
#27
Rank
#511MediumFrequency: 19.5%
All Paths from Source Lead to Destination
#28
Rank
#1696HardFrequency: 18%
Strange Printer II
#29
Rank
#2506HardFrequency: 16.4%
Minimize Maximum Value in a Grid
#30
Rank
#2409HardFrequency: 12%
Number of Increasing Paths in a Grid
#31
Rank
#3919HardFrequency: 10.3%
Network Recovery Pathways
#32
Rank
#1309HardFrequency: 8.1%
Sort Items by Groups Respecting Dependencies
#33
Rank
#2439HardFrequency: 7.3%
Longest Cycle in a Graph
#34
Rank
Master Topological Sort in Real Interviews
Get AI-powered assistance when solving topological sort problems during your actual interviews.
Get Started FreeNo credit card required