Langestpalindromicsubsequence(dp)

// C++ program of above approach
#include<bits/stdc++.h>
using namespace std;
 
// A utility function to get max of two integers
int max (int x, int y) { return (x > y)? x : y; }
 
// Returns the length of the longest palindromic subsequence in seq
int lps(char *seq, int i, int j)
{
// Base Case 1: If there is only 1 character
if (i == j)
    return 1;
 
// Base Case 2: If there are only 2
// characters and both are same
if (seq[i] == seq[j] && i + 1 == j)
    return 2;
 
// If the first and last characters match
if (seq[i] == seq[j])
    return lps (seq, i+1, j-1) + 2;
 
// If the first and last characters do not match
return max( lps(seq, i, j-1), lps(seq, i+1, j) );
}
 
/* Driver program to test above functions */
int main()
{
    char seq[] = "GEEKSFORGEEKS";
    int n = strlen(seq);
    cout << "The length of the LPS is "
         << lps(seq, 0, n-1);
    return 0;
}
 
// This code is contributed
// by Akanksha Rai

Source: geeksforgeeks.org

Similar codes

1 vote326 views3 answers
('Failed to import pydot. You must `pip install pydot` and install graphviz (https://graphviz.gitlab.io/download/), ', 'for `pydotprint` to work.')
C++
2 votes388 views1 answer
String to wstring
C++
5 votes355 views6 answers
Binary search algorithm
C++
1 vote308 views1 answer
Cuda dim3
C++
0 vote282 views1 answer
C++ code executio canntot proceed because glew32.dll was not founud
C++
1 vote333 views1 answer
C++ arrray
C++
1 vote334 views1 answer
GetCurrentThreadId c
C++
0 vote298 views1 answer
C++, for-loop over an array array
C++
0 vote304 views1 answer
CudaMalloc
C++
0 vote310 views1 answer
C++ nerds
C++