Revision as of 20:11, 18 May 2019 edit 103.102.43.254 (talk) No edit summary ← Previous edit		Revision as of 19:03, 14 June 2019 edit undo Glrx (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 29,708 edits Undid revision 895885186 by 100.34.22.212 (talk) inline ref; blog; off topic Tag: Undo Next edit →
Line 423: The Booth algorithm uses a modified version of the KMP preprocessing function to find the [[lexicographically minimal string rotation]]. The failure function is progressively calculated as the string is rotated. An application of KMP to efficient palindrome-finding (and a detailed, simple explanation of the algorithm in simple English can be found at https://leetcode.com/problems/shortest-palindrome/discuss/60113/Clean-KMP-solution-with-super-detailed-explanation) ==References==

Knuth–Morris–Pratt algorithm: Difference between revisions