_rangel's blog

By _rangel, history, 23 months ago, In English,


Guys, I'd like to know how to find the largest common pallindrom of N (1 <= N <= 15) strings. I know the Manachers algorithm finds in linear time for a string. How would I find the common N-strings?

Thank you: D

Read more »

  • Vote: I like it
  • 0
  • Vote: I do not like it