โ† Infosys questions

Travelling Sales Person Problem using Dynamic Programming

Filed under Infosys

Given a set of cities and distances between every pair, find the shortest possible route that visits each 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 Infosys questions

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