Make Palindrome Problem - Dynamic Programming Solutions

This is a C++ Program that Solves Make Palindrome Problem using Dynamic Programming technique.

Problem Description

You are given a string str. Find the minimum number of characters to be inserted to string str to convert it to a palindrome.

Problem Solution

This problem is a variation of the longest common subsequence problem. First, find the LCS of the given string and its reverse. Then, the required result is simply the length of given string minus the calculated LCS.

Expected Input and Output

Case-1:

str= ABCDE
result = 4 (ABCDEDCBA)

Program/Source Code

Here is source code of the C++ Program to Solve Make Palindrome Problem. The C++ program is successfully compiled and run on a Linux system. The program output is also shown below.

```
#include<iostream>
```
```
#include<string>
```
```
#include<algorithm>
```
```
 
```
```
using namespace std;
```
```
 
```

int longestCommonSubsequece(string str1, string str2)

```
{
```

    int len1=str1.length(), len2=str2.length();

```
    int i, j;
```
```
 
```

    //create a matrix of order (len1+1)*(len2+1) to tabulate values

```
    int LCS[len1+1][len2+1];
```
```
 
```

    //LCS[i][j]=Length of longest common subsequence of str1[0....(i-1)] and str2[0...(j-1)]

```
 
```
```
    //initializing
```
```
    for(i=0;i<=len1;i++)
```
```
        LCS[i][0]=0;    //empty str2
```
```
 
```
```
    for(j=0;j<=len2;j++)
```
```
        LCS[0][j]=0;   //empty str1
```
```
 
```

    //now, start filling the matrix row wise

```
    for(i=1;i<=len1;i++)
```
```
    {
```
```
        for(j=1;j<=len2;j++)
```
```
        {
```

            //if current character of both strings match

```
            if(str1[i-1]==str2[j-1])
```
```
            {
```

                LCS[i][j]=1+LCS[i-1][j-1];

```
            }
```
```
 
```
```
            //mismatch
```
```
            else
```
```
            {
```

                LCS[i][j]=max(LCS[i-1][j],LCS[i][j-1]);

```
            }
```
```
        }
```
```
    }
```
```
 
```
```
    //now, return the final value 
```
```
    return LCS[len1][len2];
```
```
 
```
```
}
```
```
 
```
```
int main()
```
```
{
```
```
    string str1;
```
```
 
```
```
    cout<<"Enter the string - ";
```
```
    getline(cin,str1);
```
```
 
```
```
    string str2=str1;
```
```
    reverse(str2.begin(),str2.end());
```
```
 
```

    cout<<"Minimum number of characters to be inserted in the input string to make it a palindrome is "<<endl;

    cout<<str1.length()-longestCommonSubsequece(str1,str2);

```
 
```
```
    cout<<endl;
```
```
    return 0;
```
```
}
```

Program Explanation

In the main function, we will take input for str1 and str2. We will pass these to the function longestCommonSubsequence as parameters. This function will calculate the result using bottom up DP and return the value which is displayed on the standard output.

Runtime Test Cases

 
Case-1:
$ g++ make_palindrome.cpp
$ ./a.out
Enter the string - abcde
Minimum number of characters to be inserted in the input string to make it a palindrome is 
4

Sanfoundry Global Education & Learning Series – Dynamic Programming Problems.
To practice all Dynamic Programming Problems, here is complete set of 100+ Problems and Solutions.

Sanfoundry Certification Contest of the Month is Live. 100+ Subjects. Participate Now!

If you find any mistake above, kindly email to [email protected]

« Prev - Longest Arithmetic Progression – Dynamic Programming Solutions

» Next - Bellman Ford Algorithm using Dynamic Programming

Related Posts:

Recommended Articles: