title: Find the longest prefix of a string s that is a substring of the reversal of the string s
body: <p>Are there any ways to use linear-time algorithm to find the longest prefix of a string s that is a substring of the reversal of the string s?</p>