← Snapdeal questions
CodingHard

Traveling Salesman Problem

Filed under Snapdeal

Given a list of cities and the distances between each pair of cities, find the shortest possible route that visits each city exactly once and returns to the origin city. Discuss its NP-Hard nature and…

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

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