Shortest-Superstring-Problem

Messy but working solution to the NP-hard problem that is "The Shortest Superstring problem". Takes as input a List of n strings, and returns the shortest string that contains each string of the input as a substring.