HARMAN INTERNATIONAL Hiring | On-Campus OA (2024) | Minimum Score of a Path Between Two Cities

Problem Statement You are given an undirected connected graph representing a network of cities. There are n cities numbered from 1 to n, and a list of roads connecting them. Each road is represented as: roads[i] = [a, b, distance] where: a and b are the cities connected by the road. distance is the distance of that road. The score of a path between two cities is defined as the minimum distance of any road present on that path. For ...