Available question text
Given an undirected weighted graph, find the minimum possible path score between city 1 and city n, where a path's score is the smallest edge weight along that path. This reduces to finding the connected component containing 1 and n and returning the minimum edge weight inside that component (use BFS/DFS or Union-Find to identify the component).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Amazon
Leetcode 2492. Minimum Score of a Path Between Two Cities
Reported Feb 7, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source