DSA
DSA copied to clipboard
Palindrome Partitioning (CPP)
Given a string s, a partitioning of the string is a palindrome partitioning if every sub-string of the partition is a palindrome. Determine the fewest cuts needed for palindrome partitioning of given string EXAMPLE: Input: s = "ababbbabbababa" Output: 3 Explaination: After 3 partitioning substrings are "a", "babbbab", "b", "ababa".
please assign this to me to work on it and allow me to add up in dp folder of repository
@arnab2001 please assign this to me
Hello, Can you please assign this issue to me?