4 QUESTIONS
Q1 1 / 4 medium
Bitmask DP — Traveling Salesman (Small n)
Given n cities (n ≤ 20) and a distance matrix, find the shortest route visiting every city exactly once and returning to the start.
What are the subproblems you need to solve?