<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 mn_ch(string s,int i,int j)
{
    int cnt=0;
    // ind,..,ind+len-1
    while(i<j)
    {
        if(s[i++]!=s[j--])cnt++;
    }
    return cnt;
}
int solve(string &s,int k,int ind,int len, vector<vector<vector<int>>> &dp)
{
    if(ind<0)return 1e9;
    if(k==1)
    {
        return mn_ch(s,0,ind);
    }
    if(dp[ind][k][len]!=-1)return dp[ind][k][len];
     int cnt=mn_ch(s,ind,ind+len-1);
     if(ind==1&&len==2&&k==2)cout<<cnt<<endl;
     int div=cnt+solve(s,k-1,ind-1,1,dp);
     int nodi=solve(s,k,ind-1,len+1,dp);
     return dp[ind][k][len]=min(div,nodi);
}
    int palindromePartition(string s, int k) {
         vector<vector<vector<int>>> dp(s.size(),vector<vector<int>>(k+1,vector<int>(s.size()+1,-1)));
         return solve(s,k,s.size()-1,1,dp); 
    }
};
110493