<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 dp[101][101];
int f(string s){
    int n=s.size();
    int cnt=0;
    for(int i=0;i<n/2;i++){
    if(s[i]!=s[n-1-i]){
        cnt++;
    }
    }
    cout<<s<<" "<<cnt<<endl;
    return cnt;
}
int f1(int i,string s,int k){
    int n=s.size();
    if(k==0){
        if(i<n){
        string s1=s.substr(i,n-i+1);
        int cnt=f(s1);
        
        return cnt;
        }
        return 0;
    }
    if(k<0){
        return 1e9;
    }
    if(i==n){
        return 1e9;
    }
    if(dp[i][k]!=-1){
        return dp[i][k];
    }
    int ans=1e9;
    for(int j=i;j<n-1;j++){
    string s1=s.substr(i,j-i+1);
    int cnt=f(s1);
    if(j-i+1==n){
     ans=min(ans,cnt+f1(j+1,s,k));
    }
    else{
      ans=min(ans,cnt+f1(j+1,s,k-1));  
    }
    }
    return dp[i][k]=ans;
}
    int palindromePartition(string s, int k) {
        memset(dp,-1,sizeof(dp));
        return f1(0,s,k-1);
    }
};
121356