Longest Palindromic Substring — Manacher's Algorithm (Video tutorial)

Правка en2, от vedhant, 2020-03-29 09:44:50

Hi, Manacher's algorithm is used to find the longest palindromic substring in linear time. Its a fairly complex algorithm and understanding its time complexity is the hardest part. So, I have made a video on Manacher's algorithm to help you understand it to the fullest.

Practice problems : — Easy — https://www.codechef.com/problems/PALIN3 — Hard — https://codeforces.me/contest/1080/problem/E

Happy coding!

Теги manacher algo, #tutorial

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский vedhant 2020-03-29 09:47:37 36 Tiny change: 'oblems :\n- Easy :' -> 'oblems :\n\n- Easy :'
en2 Английский vedhant 2020-03-29 09:44:50 158
en1 Английский vedhant 2020-03-27 16:09:58 405 Initial revision (published)