Feature: Longest palindromic subsequence in cpp

[cyano004]

I would liike to add unique solution to the longest paliindromic subsequence in cpp

[heyhimansh]

hey i would like to add cpp solution for this

[abhaysingla05]

Assign me this !!

[vkaash-sharma]

i can do this by using another approach please assign to me

[Sakshiwalode28]

I would like to work on this issue please assign it to me.

[AdityaSai2004]

@keshavsingh4522 I would like to share my solution for this. Would be great if I can get assigned to it.

[Riya-2211]

#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;
}

[ragnarok-02]

I would like to work on this issue, please assign this to me.

[ghost]

assign me this

[kanikarajpal]

Can you please assign this to me?

[prabhat108]

HEY PLEASE ASSIGN IT TO ME