Optimize Meeting Point for Friends in a Graph
Given a graph with n friends at different locations and m possible meeting points (restaurants/cafes), find the optimal meeting location. The goal is to minimize either the total travel time or the maximum time for any friend to reach the meeting point. Each edge in the graph represents a path with unit distance taking unit time to travel.
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Mid October, 2024
Meta
Mid-level
Mid October, 2024
Mid-level
Find the restaurant with shortest total travel distance for K friends. Given K friends' locations, M restaurant locations, and E edges, determine the restaurant where the total travel distance from all friends is shortest. Return -1 if no such restaurant exists.
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.