Given a graph of N cities and M undirected roads, and a list of K cities that contain hospitals, find the maximum distance (number of edges) any city has to travel to reach its nearest hospital.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.