This description is poorly worded
I am posting this in hopes that it helps others go about solving or understand the ask without having to look up solutions. It took me a lot of reading others\'
I am posting this in hopes that it helps others go about solving or understand the ask without having to look up solutions. It took me a lot of reading others\' posts to understand what it was that was even being asked. \n\nMostly because the problem implies an order to the algorithm by saying  `First <Do this>`, and `Then <do that>`.  The description also says `change some` but never really defines what **some** is, before describing subdivisions.  The final return language says `need to <do this>`, but the *`<this>`* is really a precondition and not the result.\n\nIt bugged me and it unfairly makes the problem harder than it is. I think if this were in a real interview, I would have been seen as difficult in just trying to understand the rules of the problem.\n\nFor others, here is how I see the ask:\n\n```\nReturn the minnimum number of characters that need to be changed such that:\n     After splitting the input into k substrings, \n\t All substrings are non-empty and palindromes \n```\n\n**Example 1:**\n```\nInput: s = "abc", k =2\nCan be split in the following ways:\n     [ \'ab\', \'c\' ] or [\'a\', \'bc\' ] \n\t \nNote: [\'abc\', \'\'] and [\'\', \'abc\'] are invalid splits because \'\' is an empty string\n\nCase: [\'ab\',\'c\'] The number of characters needed to be changed so all strings are palindromes is 1  \nEither the character \'a\' or \'b\' must change to proudce [\'aa\', \'c\'] or [\'bb\', \'c\'] \n\nCase: [\'a\', \'bc\']. Number of character changes: 1. \nEither the character \'b\' or \'c\' must change to proudce [\'a\', \'bb\'] or [\'a\', \'cc\'] .\n\nMinnimum number of changes among all the splits is 1.\n\nOutput: 1\n```\n
[]