{leetcode}/problems/palindrome-partitioning-ii/[LeetCode - Palindrome Partitioning II^]
Given a string s, partition s such that every substring of the partition is a palindrome.
Return the minimum cuts needed for a palindrome partitioning of s.
Example:
Input: "aab" Output: 1 Explanation: The palindrome partitioning ["aa","b"] could be produced using 1 cut.
link:{sourcedir}/_0132_PalindromePartitioningII.java[role=include]