Tag - longest palindromic subsequence

Longest Palindromic Substring

Longest Palindromic Substring - Dynamic Programming -Given a string,find the longest substring which is palindrome. For example, if the given string ing is

C program to check subsequence

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

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

Java Programming - Longest Palindromic Subsequence - Dynamic Programming The solution for this problem is to generate all subsequences of the given sequence

Cpp Programming – Longest Palindromic Subsequence

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

Manacher’s Algorithm - Linear Time Longest Palindromic Substring - Searching and sorting - We have already discussed Naïve [O(n3)] and quadratic [O(n2)]