208. 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 : 1
Explanation : The palindrome partitioning ["aa", "b"] could be produced using 1 cut.
Example 2:
Input : s = "abaaba"
Output : 0
Explanation : The complete string can be considered as a partition as the string itself is palindrome.
There are other ways to partition the string but it requires more number of cuts.
Now Your Turn!
Pick the correct output for the given inputInput : s = "abcd"
Still unsure what the problem is asking ?
Let’s go through a few more examples, step by step, to make it clearer.
Constraints:
- 1 <= s.length <= 2000
- s consist of only lowercase English letters