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 1
Input
s = "aab"Output
1The palindrome partitioning ["aa", "b"] could be produced using 1 cut.
Example 2
Input
s = "a"Output
0A single-character string is already a palindrome, so no cuts are needed.
Constraints
- 1 <= s.length <= 2000
- s consists of lowercase English letters only.