Travelling Salesman Problem using Dynamic Programming 

Time Complexity of the above solution is O(n^2 * 2^n) and space complexity is O(n* 2^n).