Leetcode 2492. Minimum Score of a Path Between Two Cities

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).