Milk Van Circular Route Distance
Milk Van Circular Route Distance
HardArrays100% accepted
Ravi drives a milk van in Bangalore visiting multiple residential colonies. Given GPS coordinates of all delivery points, find the minimum total distance to visit all colonies and return to start.
Approach
Given an array of N coordinate points, find the minimum Euclidean distance to visit all points cyclically.
Input
n=4, coords=[[0,0],[1,0],[1,1],[0,1]]
Output
4
More Arrays problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards