<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 {
    private:
    int req(string t){
        int x=t.size();
        int i=0,j=x-1;
        int count=0;
        while(i<j){
            if(t[i]!=t[j])count++;
            i++;j--;
        }
        return count;
    }
    int solver(int i,string s, int k,vector<vector<int>>&dp){
        if(k==0 && i<s.size())return 1e6;
        if(i>=s.size()){
            if(k==0)return 0;
            return 1e6;
        }
        if(dp[i][k]!=-1)return dp[i][k];
int n=s.size();
int ans=INT_MAX;
        for(int j=i;j<n;j++){
        if(k>0)  { int count=req(s.substr(i,j-i+1));
           int total=count+solver(j+1,s,k-1,dp);
           ans=min(ans,total);}
        }
        return dp[i][k]=ans;
    }
public:
    int palindromePartition(string s, int k) {
        int n=s.size();
           vector<vector<int>> dp(n,vector<int>(k+1,-1));
        return solver(0,s,k,dp);
        
    }
};
119183