Train Routes Connectivity and Shortest Path
Filed under Cadence
The question
Given m arrays representing train routes containing station numbers where movement between routes is possible via common stations, determine if a path exists between two stations, and find the minimum number of route changes required.
No write-up yet. Related questions below have one.
Related Cadence questions
Collected from public candidate posts and coding forums. Updated Nov 2026.