<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 dp1[105][105];
int change(string s,int l,int r){
   if(l>=r) return 0;
   if(dp1[l][r]!=-1) return dp1[l][r];
   if(s[l]==s[r]) return dp1[l][r]=change(s,l+1,r-1);
   return dp1[l][r]=1+change(s,l+1,r-1);
   }
 int dp[105][104];
int f(string&s,int idx,int curr,int k){
    if(idx>=s.size()){
        if(curr==k) return 0;
        else return 10000;
    }
    if(curr>k) return 100000;
    if(dp[idx][curr]!=-1) return dp[idx][curr];
    int ans=10000;
    for(int i=idx;i<s.size();i++){
        if(curr+1<=k){
            ans=min(ans,change(s,idx,i)+f(s,i+1,curr+1,k));
        }

    }
    return dp[idx][curr]=ans;
}
    int palindromePartition(string s, int k) {
        memset(dp,-1,sizeof(dp));
        memset(dp1,-1,sizeof(dp1));
        return f(s,0,0,k);
        
    }
};
103976