Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Python

Solution: Bus Routes

Explore how to solve the bus routes problem by building an adjacency list to map stations to bus routes, then apply breadth-first search (BFS) to determine the minimum buses required to travel from a source station to a destination. Learn to manage visited routes and optimize for shortest path in an unweighted graph.

We'll cover the following...

Statement

You are given an array, routes, representing bus routes where routes[i] is a bus route that the ithi^{th} bus repeats forever. Every route contains one or more stations. You have also been given the source station, src, and a destination station, des. Return the minimum number of buses someone must take to travel from src to dest, or return -1 if there is no route.

Constraints:

  • 1≤1 \le routes.length ≤50\le 50
...