You are given a string s and an integer k. You need to divide s into k non-empty disjoint substrings.

For each substring, you can change any of its characters to any other character.

Return the minimum number of character changes required so that each of the k substrings becomes a palindrome.

Constraints:

• $1 \leq$ k $\leq$ s.length $\leq 100$

• s consists of only lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.