Longest Palindromic Substring - Dynamic Programming -Given a string,find the longest substring which is palindrome. For example, if the given string ing is
Tag - longest palindromes
Manacher’s Algorithm - Linear Time Longest Palindromic Substring - Searching and sorting - We have already discussed Naïve [O(n3)] and quadratic [O(n2)]
