Bus Routes
Try to solve the Bus Routes problem.
We'll cover the following
Statement
You are given an array, routes
, representing bus routes where routes[i]
is a bus route that the bus repeats forever. Every route contains one or more stations. You have also been given the source station, src
, and a destination station, dest
. Return the minimum number of buses someone must take to travel from src
to dest
, or return -1
if there is no route.
Constraints:
-
routes.length
-
routes[i].length
-
routes[i][j]
-
src
,dest
Examples
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy