Added solution - LeetHub

Author: suniti0804

Minimum number of deletions. - GFG/minimum-number-of-deletions..cpp

@@ -0,0 +1,52 @@
+//{ Driver Code Starts
+#include <bits/stdc++.h>
+using namespace std;
+int minDeletions(string str, int n);
+
+int main(){
+    int t;
+    cin >> t;
+    while(t--){
+        
+        int n;
+        cin >> n;
+        string s;
+        cin >> s;
+        cout << minDeletions(s, n) << endl;
+
+    }
+return 0;
+}
+// } Driver Code Ends
+
+ int LCS(string a, string b, int n)
+   {
+       int t[n + 1][n + 1];
+       for(int i = 0; i <= n; i++)
+       {
+           for(int j = 0; j <= n; j++)
+           {
+               if(i == 0 || j == 0)
+                 t[i][j] = 0;
+               else if(a[i - 1] == b[j - 1])
+                 t[i][j] = 1 + t[i - 1][j - 1];
+               else
+                 t[i][j] = max(t[i - 1][j], t[i][j - 1]);
+           }
+       }
+       
+       return t[n][n];
+   }
+  
+   int LPS(string s)
+   {
+       string a = s;
+       reverse(s.begin(), s.end());
+       string b = s;
+       int n = s.size();
+       return LCS(a, b, n);
+   }
+
+int minDeletions(string s, int n) { 
+    return s.size() - LPS(s); 
+}