Given a string S[1....n] and l where l is an integer less than n then how can we efficiently construct the function f(n) (please see below for more explanation) for every string S[i,j] where ji=l f(n) denotes the longest longest suffix which is also the prefix of a string. asked 26 Oct '14, 21:31

prefix of string S[1...N] or S[i,j] ??