The reading room
Algorithms
Recover the route from a breadth-first search
Build a route finder that remembers each transfer, handles a cycle, and distinguishes staying put from an unreachable stop.
How many rooms do back-to-back bookings need?
Walk through a timetable where arrivals and departures share a timestamp. Build a sweep that counts the rooms in use.
