At first, I wasn't entirely sure it was the traveling salesman problem, and I didn't want to say it was an NP-hard problem because I wasn't sure. After the interviewer confirmed it was the case, I stated that there was no known solution for this problem in polynomial time, and I said it could be solved using brute-force approaches for small data sets.