Bus Routes: coding question

Available question text

Given repeating bus routes and start/target stops, find the minimum number of bus rides required to go from source to target (or -1 if impossible). This is solved by modeling routes/stops as a graph (e.g., routes as nodes connected when they share stops) and performing BFS to find the shortest transfer path — note constraints: up to 500 routes and 1e5 total stop entries.

Continue with questions that share topics or the same question type.

Accounts Merge
Coding · Array · Breadth-First Search · Depth-First Search
Minimize Malware Spread
Coding · Array · Breadth-First Search · Depth-First Search
Number of Distinct Islands
Coding · Array · Breadth-First Search · Depth-First Search
Smallest Common Region
Coding · Array · Binary Lifting · Breadth-First Search

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 5 records

Amazon
Leetcode 815. Bus Routes
Reported Sep 24, 2026 · 3 source reports
MID_LEVEL, SENIOR
Source snapshot: Nov 12, 2026
View source
Coupang
Leetcode 815. Bus Routes
Reported Oct 14, 2025 · 1 source report
STAFF
Source snapshot: Nov 12, 2026
View source
PayPal
Leetcode 815. Bus Routes
Reported Feb 5, 2026 · 1 source report
SENIOR
Source snapshot: Nov 12, 2026
View source
Pinterest
Leetcode 815. Bus Routes
Reported Sep 10, 2026 · 2 source reports
MID_LEVEL
Source snapshot: Nov 12, 2026
View source

Available question text

Bus Routes

Available question text

Related questions

Bus Routes

Available question text

Related questions