_rangel's blog

By _rangel, history, 6 years ago, In English

Hello!

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

Full text and comments »

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