<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 {
    int pali(string &x, int s, int e){
        int c=0;
        while(s<e){
            if(x[s]!=x[e]) c++;
            s++; e--;
        }

        return c;
    }

    int fun(string s, int i, int k, vector<vector<int>> &lol){
        if(k==1) return pali(s,i,s.size()-1);
        if(lol[i][k]!=-1) return lol[i][k];

        int x=INT_MAX;
        for(int j=i; j<=s.size()-k; j++){
            x=min(x,pali(s,i,j)+fun(s,j+1,k-1,lol));
        }

        return lol[i][k]= x;
    }
public:
    int palindromePartition(string s, int k) {
        vector<vector<int>> lol(s.size()+1,vector<int>(k+1,-1));
        return fun(s,0,k,lol);
    }
};
36628