Given a string s, find the longest prefix p that also occurs at the end (so that s = p + t + p), and return t, the string without the beginning and the end.