Minimum Palindrome Cuts
Lesson 3 of 3 in Coddy's Interview Coding Challenges - Pack VII course.
Challenge
HardWrite a function named minPalindromeCuts to find the minimum number of cuts needed to partition a string into a set of palindromes.
The function should take a string as input and return the minimum number of cuts needed.
A cut is a partition of the string into two non-empty substrings.
For example, the string "abccbda" can be partitioned into the set of palindromes {"a", "bccb", "d", "a"} with three cuts
Try it yourself
int minPalindromeCuts(char* s) {
// Write code here
}