Proper cutting

Computer Science Level 5

Given a string of characters it is required to cut the strings such that each of the cuts is a palindrome.

For example the string addbcbb can be cut as a|dd|bcb|b , a|dd|b|c|bb....... What is the minimum number cuts required for the string in the text so that each individual cut is a palindrome.

Details and Assumption

A single character is considered to be a palindrome. So in essence every string can be cut up palindromically.


Problem Loading...

Note Loading...

Set Loading...