leetcode/problems/find-the-shortest-superstring at master · jsaluja/leetcode

Name		Name	Last commit message	Last commit date
parent directory ..
README.md		README.md
find_the_shortest_superstring.go		find_the_shortest_superstring.go
find_the_shortest_superstring_test.go		find_the_shortest_superstring_test.go

README.md

< Previous 　　　　　　　　　　　　　　　　 Next >

Given an array A of strings, find any smallest string that contains each string in A as a substring.

We may assume that no string in A is substring of another string in A.

Example 1:

Input: ["alex","loves","leetcode"]
Output: "alexlovesleetcode"
Explanation: All permutations of "alex","loves","leetcode" would also be accepted.

Example 2:

Input: ["catg","ctaagt","gcta","ttca","atgcatc"]
Output: "gctaagttcatgcatc"

Note: