How to find the largest common palindrome of N strings?

Правка en1, от _rangel, 2017-11-15 02:14:45

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

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский _rangel 2017-11-15 02:14:45 280 Initial revision (published)