← Expedia questions

Minimum travel cost among N cities in a 2D plane

Filed under Expedia

Given an array of coordinates representing N cities on a 2D plane, find the minimum cost to connect all cities such that there is a path between any two cities. The cost of connecting two cities is…

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 Expedia questions

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