← Google questions
CodingReported in a candidate post, Oct 2024

Find meeting city for minimum cost in an undirected unweighted graph

Filed under Google

Given an undirected unweighted graph of cities, find a meeting city C such that the sum of distances from X to C and Y to C is minimized.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.