<p>You are given a string <code>s</code> containing lowercase letters and an integer <code>k</code>. You need to :</p>

<ul>
	<li>First, change some characters of <code>s</code> to other lowercase English letters.</li>
	<li>Then divide <code>s</code> into <code>k</code> non-empty disjoint substrings such that each substring is a palindrome.</li>
</ul>

<p>Return <em>the minimal number of characters that you need to change to divide the string</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abc&quot;, k = 2
<strong>Output:</strong> 1
<strong>Explanation:</strong>&nbsp;You can split the string into &quot;ab&quot; and &quot;c&quot;, and change 1 character in &quot;ab&quot; to make it palindrome.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aabbc&quot;, k = 3
<strong>Output:</strong> 0
<strong>Explanation:</strong>&nbsp;You can split the string into &quot;aa&quot;, &quot;bb&quot; and &quot;c&quot;, all of them are palindrome.</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;leetcode&quot;, k = 8
<strong>Output:</strong> 0
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= k &lt;= s.length &lt;= 100</code>.</li>
	<li><code>s</code> only contains lowercase English letters.</li>
</ul>

class Solution {
public:
    int countforpal(string str){
        int n=str.length();
        int i=0,j=n-1,count=0;
        while(i<j){
            if(str[i]!=str[j])count++;
            i++;
            j--;
        }
        return count;
    }
    int recurfunc(int ind,int j,int k,string s,vector<vector<int>> &dp){
        int n=s.length();
        if(ind == n and j==k)return 0;
        if(ind == n or j==k )return -1;
        if(dp[ind][j]!=-1)return dp[ind][j];
        string str="";
        int ans=INT_MAX;
        for(int i=ind;i<n;i++){
            str=str+s[i];
            int temp=countforpal(str);
            int res=recurfunc(i+1,j+1,k,s,dp);
            if(res!=-1 and res!=INT_MAX)ans=min(ans,temp+res);
        }
        return dp[ind][j]=ans;
    }
    int palindromePartition(string s, int k) {
        int n=s.length();
        if(n == k)return 0;
        vector<vector<int>>dp(n+1,vector<int>(k+1,-1));
        return recurfunc(0,0,k,s,dp);
    }
};
125701