Minimum Cuts for Palindrome Partitioning

Hard Palindromes

Log in to solve

Split s into pieces so that every piece is a palindrome. Print the minimum number of cuts needed.

Constraints

1 <= |s| <= 2000

No discussions yet.