← Amazon questions
CodingReported in a candidate post, Jun 2019

Travelling Salesman Problem

Filed under Amazon · Also reported at Symantec, TCS

Given a list of cities and the distances between each pair, find the shortest possible route that visits every city exactly once and returns to the origin city.

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

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