<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 isPalindrome(string s, int i, int j){
        //cout<<i<<" "<<j<<endl;
        int I=i,J=j;
        int cnt=0;
        while(i<j){
            if(s[i]!=s[j]) cnt++;
            i++; j--;
        }
        //if(I==4) cout<<I<<" "<<J<<" "<<cnt<<endl;
       return cnt;
    }
    

    int solve(string & s, int i, int j, vector<vector<int>> & dp,int lim){    
         if(i>j) return INT_MAX;
         if(lim==0) return isPalindrome(s,i,j);

        if(dp[i][lim]!=-1) return dp[i][lim];
        
        long long ans = INT_MAX;
        
        for(int k=i; k<j; k++){
            long long cnt=isPalindrome(s, i, k);
            //cout<<i<<" "<<k<<" "<<cnt<<endl;                      
            long long temp = (long long)(solve(s, k+1, j, dp,lim-1) + cnt);
             //cout<<i<<" "<<k<<" "<<cnt<<" " <<temp<<endl;  
            ans = min(ans, temp);
        } 
        return dp[i][lim]=ans;
    }
    
    int palindromePartition(string s, int k) {
    int n=s.size();
    vector<vector<int>> dp(n+1,vector<int>(k+1,-1));
    cout<<n-1<<endl;
    int ans=solve(s,0,n-1,dp,k-1); 
    return ans;
    }
};
69216