Longest Palindromic Substring – Dynamic Programming -Given a string,find the longest substring which is palindrome. For example, if the given string ing is
longest palindromic subsequence
6 Articles
6
C program to check subsequence – C Programming – User will input two strings and we find if one of the strings is a subsequence of other.
Python Programming – Longest Palindromic Subsequence – Dynamic Programming The solution for this problem is to generate all subsequences of the given sequence
Java Programming – Longest Palindromic Subsequence – Dynamic Programming The solution for this problem is to generate all subsequences of the given sequence
C++ Programming – Longest Palindromic Subsequence – Dynamic Programming The solution for this problem is to generate all subsequences of the given sequence
Manacher’s Algorithm – Linear Time Longest Palindromic Substring – Searching and sorting – We have already discussed Naïve [O(n3)] and quadratic [O(n2)]