Question d’entretien chez Google

Travelling Salesman Problem I Set 1 (Naive and Dynamic Programming).