Given a string, how many minimum splits would it take so that each partition after split is a palindrome.
Same Problem Link
[LintCode] Palindrome Partitioning II