The longest Weak repeated substring problem

[lena]

Suppose S is a string S[1....n], we call a substring P of S weak repeated,if
P=s[i...j] satisfied : there exists another subtring T=s[k...l], T equals to P, and i != k.
can someone give me an answer

[mf]

Suppose S is a string S[1....n], we call a substring P of S weak repeated,if
P=s[i...j] satisfied : there exists another subtring T=s[k...l], T equals to P, and i != k.

Build a suffix tree for string S$, and choose the string corresponding to any deepest non-leaf node as P.

can someone give me an answer

42
But you forgot to tell the question...