diff --git a/23 May  K-Palindrome b/23 May  K-Palindrome
new file mode 100644
index 00000000..24041da1
--- /dev/null
+++ b/23 May  K-Palindrome	
@@ -0,0 +1,14 @@
+class Solution{
+public:
+    int kPalindrome(string s, int n, int k)
+    {
+        // code here
+    vector<int>curr(n+1,0),ahead(n+1,0);
+    for(int x=n-1;x>=0;x--){
+        for(int y=n-1;y>=0;y--) 
+             curr[y]= max({ahead[y],curr[y+1],(s[x]==s[n-y-1])?1+ahead[y+1]:0}); 
+        ahead=curr;
+    }  
+    return n-curr[0]<=k;
+    }
+};