From cb1532bad23ec4374540ca539a05ae4e6ea37ddc Mon Sep 17 00:00:00 2001
From: aayushi-kunwar13 <51057675+aayushi-kunwar13@users.noreply.github.com>
Date: Sun, 4 Oct 2020 03:00:08 +0530
Subject: [PATCH] Palindromic partitioning of a  given string

---
 Palindromic Partitioning | 38 ++++++++++++++++++++++++++++++++++++++
 1 file changed, 38 insertions(+)
 create mode 100644 Palindromic Partitioning

diff --git a/Palindromic Partitioning b/Palindromic Partitioning
new file mode 100644
index 0000000..c6dff84
--- /dev/null
+++ b/Palindromic Partitioning	
@@ -0,0 +1,38 @@
+Return the minimum cuts needed for a palindrome partitioning of A.
+
+Example:
+Input : A = "aab"
+Output : 1
+
+
+
+int Solution::minCut(string A) {
+    int n = A.length(), i, k, j;
+    int dp[n][n];
+    int C[n];
+    for(i=0; i<n ; i++){
+        dp[i][i] = 0;
+    }
+    for(i=0;i<n;i++){
+        for(j=0;j<n ; j++){
+            dp[i][j] = 0;
+        }
+    }
+    for(k=2; k<=n ; k++){
+        for(i=0; i<n-k+1; i++){
+            j=i+k-1;
+            if(k == 2){
+                dp[i][j] = (A[i] == A[j])? 0:1;
+            }
+            else {
+                if(A[i] == A[j]){
+                    dp[i][j] = dp[i+1][j-1];
+                }
+                else{
+                    dp[i][j] = 1+min(dp[i-1][j] , dp[i][j+1]);
+                }
+            }
+        }
+    }
+    return dp[0][n-1];
+}