Minimum Palindromic Cut
easy
1. You are given a string. 2. You have to find the minimum number of cuts required to convert the given string into palindromic partitions. 3. Partitioning of the string is a palindromic partitioning if every substring of the partition is a palindrome.
Constraints
1 <= length of string <= 10^4
Format
Input
A string
Output
Check the sample output and question video.
Example
Sample Input
abccbc
Sample Output
2
Question Video