You are given an array, routes, representing bus routes where routes[i] is a bus route that the $i^{th}$ 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:

• $1 \le$ routes.length $\le 50$
• $1 \le$ routes[i].length $\le 100$
• $0 \le$ routes[i][j] $< 1000$
• $0 \le$ src, dest $< 1000$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.