<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 isPal(int i, int j, string s){
        int st=i,e=j,c=0;
        while(st<e){
            if(s[st]!=s[e]) c++;
            st++;
            e--;
        }
        return c;
    }
    int check(int i, int k1, string s){
        if(i==s.size()){
            return 0;
        }
        if(k1==1) return isPal(i,s.size()-1,s);
        if(dp[i][k1]!=-1) return dp[i][k1];
        int ans = 1e7;
        for(int k=i;k<s.size()-1;k++){ 
            ans = min(ans,isPal(i,k,s)+check(k+1,k1-1,s));
        }
        return dp[i][k1]=ans;
    }
    int palindromePartition(string s, int k) {
        memset(dp,-1,sizeof(dp));
        return check(0,k,s);
    }
};
136563