Sulba
ReviewSign inAccount
Theme
Editor theme
Light
Dark

Intermediate · Coding interviews: lists, trees and graphs

Graph order and paths

Six interview problems on ordering and connecting a graph's nodes and finding its cheapest paths: an order for courses, the order of an alphabet from sorted words, the cable that closes a loop, merging accounts that share addresses, the time a message takes to reach a network, and the cheapest route within a number of stops.

You build
order.py, then letters.py, then cables.py, then accounts.py, then delay.py, then route.py
Stages
6 Problems
Time
About 3 hours

Loading the workspace…