30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

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:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Mid October, 2024

Meta

Mid-level

Mid October, 2024

Google

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

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Optimize Meeting Point for Friends in a Graph

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact