Palindrome Partitioning III

Given a string s and integer k, compute the minimum number of character changes needed so s can be split into k non-empty palindromic substrings. The challenge is to precompute the cost to turn any substring into a palindrome and use DP over partitions (n ≤ 100) to minimize the total edits.