Codeforces will not be available in the period 01:00-05:00 May, 30 (MSK, UTC +3) because of maintenance. ×

vedhant's blog

By vedhant, history, 2 months ago, In English,

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 :

Happy coding!

 
 
 
 
  • Vote: I like it
  • +22
  • Vote: I do not like it

»
2 months ago, # |
  Vote: I like it +4 Vote: I do not like it

I found it very useful!

»
2 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by vedhant (previous revision, new revision, compare).