Sponsored
Reserved space — layout preview until AdSense is connected
Data Structures & Algorithms
hard
Topological sort (Kahn)
Return a valid topological ordering of tasks, or [] if a cycle exists.
graph
BFS
topological-sort
+45 pts
40m
Data Structures & Algorithms
hard
Word ladder length
Return the length of the shortest transformation from beginWord to endWord changing one letter at a time.
BFS
graph
strings
+45 pts
40m
Showing 2 challenges · hard · filtered by category