<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 ispal(string &s){
        int i=0, j = s.size()-1;
        int cnt=0;
        while(i<j){
            if(s[i]!=s[j])cnt++;
            i++;j--;
        }
        return cnt;
    }
    int solve(int l, int n, int k, int kc, string s, vector<vector<int>>&dp){
        if(dp[l][kc]!=-1)return dp[l][kc];
        string s1;
        int ans = 101;
        for(int i=l;i<n;i++){
            s1.push_back(s[i]);
            int cnt = ispal(s1);
            ans = min(ans, cnt+solve(i+1,n,k,kc+1,s,dp));
        }
        return dp[l][kc]=ans;
    }
    int palindromePartition(string s, int k) {
        int n = s.size();
        vector<vector<int>>dp(n+1,vector<int>(k+1,-1));
        for(int i=0;i<=n;i++){
            if(i==n)dp[i][k]=0;
            else dp[i][k]=101;
        }
        return solve(0,n,k,0,s,dp);
    }
};
97458