What is the Travelling Salesman Problem? How would you approach this problem? I replied using recursion, and then we can use Dynamic Programming, as we will soon find out there will be overlapping subproblems.