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.
Input Format
A string
Output Format
Check the sample output and question video.
Constraints
1 <= length of string <= 10^4
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
abccbc
Output
2