Intermediate · 2 steps
Solve a timetable and recover a route
Practise explaining the assumptions behind two interview problems.
Start with the first step and work at your own pace.
Start the path →Enable JavaScript to mark steps complete. All lessons are available below.
Before you start
Python loops, lists and dictionaries.
What you’ll work toward
Calculate peak occupancy and reconstruct a shortest route in an unweighted graph.
Your learning sequence
2 steps · Work at your own pace2 min read
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.
2 min read
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.
