Pergunta de entrevista da empresa Google

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