Tag Archives: string-processing

Extend to Palindrome

Problem Statement

Solution:

We need to find the longest palindrome suffix of S.

  1. compute the Z function for reverse(S)$S
  2. find the smallest i<n such that i+Z[i] = n
  3. append reverse(S[1,…,i-1]) to the end of S.
Advertisements