Palindrome Partitioning II
Hard
Dynamic Programming
String
Minimum cuts for palindrome partitioning.
Input: string
Output: min cuts
Constraints
See problem-specific constraints. Optimized solution required.
Examples
Example 1:
Input: aab
Output:
Example 2:
Input: aab
Output:
Hints
Consider a string approach.
Think about time complexity.
Tests:
Runtime:
Memory:
Test
Input:
Expected:
Got:
Click Run Code to test against sample cases, or Submit to test against all cases.
▲ Console