<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 solve(string &s, int ind, int k,map<pair<int,int>,int> &mp){
        if(ind>=s.size()){
            if(k>=1)return 1e9;
            return 0;
        }
        if(k<=0)return 1e9;
        if(dp[ind][k]!=-1)return dp[ind][k];
        vector<int>v(26);
        int ans = 1e9;
        for(int j = ind;j<s.size();j++){
            v[s[j]-'a']++;
            ans = min(ans, mp[{ind,j}] + solve(s, j + 1, k-1, mp));
        }
        return dp[ind][k]=ans;
    }
    void cnt(map<pair<int,int>,int> &mp, string &st,int low,int high){
        int l = 0, r = st.size()-1;
        int cnt = 0;
        while(l<r){
            if(st[l]!=st[r])cnt++;
            l++,r--;
        }
        mp[{low,high}]=cnt;
    }
    int palindromePartition(string s, int k) {
        // vector<vector<int>>num()
        map<pair<int,int>,int>mp;
        for(int i=0;i<s.size();i++){
            string st;
            for(int j=i;j<s.size();j++){
                st += s[j];
                cnt(mp,st,i,j);
            }
        }
        memset(dp,-1,sizeof(dp));
        return solve(s,0,k,mp);
    }
};
14903