<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 minChange(string str){
        int i = 0;
        int j = str.size()-1;
        int count = 0;

        while(i<j){
            if(str[i] != str[j]) count++;
            i++;
            j--;
        }

        return count;
    }

    int dp[105][105];

    int find(int l,string &s,int k){

        if(l == s.size()){
            if(k==0) return 0;
            return INT_MAX;
        }

        if(k<0) return INT_MAX;

        int option = INT_MAX;
         
         if(dp[l][k] != -1) return dp[l][k];
        

        for(int i = l;i<s.size();i++){
            string temp = s.substr(l,i-l+1);
            int minChanges = minChange(temp);
            int value = find(i+1,s,k-1);
            if(value != INT_MAX)
            option = min(option , minChanges + value);
        }
        return dp[l][k] = option;
    }
    int palindromePartition(string s, int k) {
        int n = s.size();
        memset(dp,-1,sizeof(dp));
        return find(0,s,k);
        
    }
};
45318