Added Pallindrome Algorithm

C++/Make_Pallindrome.cpp

@@ -0,0 +1,68 @@
+// Github username: utkarshjaulkar
+// Aim: This is a C++ Program that Solves Make Palindrome Problem using Dynamic Programming technique.
+// Date: 28/10/2022
+
+// start coding
+#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;
+}

CONTRIBUTORS.md

@@ -39,6 +39,7 @@ Check bellow code as referance.
 | Arn Arn | <a href="https://github.com/arn355">arn355</a> | <a href="mailto:[email protected]">Mail</a> |
 | Sarthak Roy | <a href="https://github.com/sarthakroy2002">sarthakroy2002</a> | <a href="[email protected]">Mail</a> |
 | Niels Mijnster | <a href="https://github.com/nielsmijnster">nielsmijnster</a> | <a href="[email protected]">Mail</a> |
+| Utkarsh Jaulkar | <a href="https://github.com/utkarshjaulkar">utkarshjaulkar</a> | <a href="[email protected]">Mail</a> |
 
 <br/>
 <h2>🖥️ Happy Hacking...</h2>