DP Traveling Salesman Problem¶ Table of Contents¶ 943. Find the Shortest Superstring (Hard) 847. Shortest Path Visiting All Nodes (Hard) 2247. Maximum Cost of Trip With K Highways (Hard) 👑 943. Find the Shortest Superstring¶ LeetCode | 力扣 Tags: Array, String, Dynamic Programming, Bit Manipulation, Bitmask 847. Shortest Path Visiting All Nodes¶ LeetCode | 力扣 Tags: Dynamic Programming, Bit Manipulation, Breadth First Search, Graph, Bitmask 2247. Maximum Cost of Trip With K Highways 👑¶ LeetCode | 力扣 Tags: Dynamic Programming, Bit Manipulation, Graph, Bitmask