<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 checkpal(const string& s,int i,int j) {
        int l = i, r = j;
        int ans=0;
        while (l < r) {
            if (s[l] != s[r]) ans++;;
            l++;
            r--;
        }
        return ans;
    }
    int solve(string s,int index,int m,int k,vector<vector<int>> &dp)
    {
        if(index==s.size()){
        if(k==m)
            return 0;
            return 1e9;}
        if(m>k)
            return 1e9;
        if(dp[index][m]!=-1)
            return dp[index][m];
        string o;
        int ans=INT_MAX;
        for(int i=index;i<s.size();i++)
        {
               ans=min(ans,solve(s,i+1,m+1,k,dp)+checkpal(s,index,i));
        }
        return dp[index][m]=ans;
    }
   
    int palindromePartition(string s, int k) {
         vector<vector<int>>dp(s.size(),vector<int>(k+1,-1));
        return solve(s,0,0,k,dp);
    }
};
88768