DSA icon indicating copy to clipboard operation
DSA copied to clipboard

Palindrome Partitioning (CPP)

Open pranil-19 opened this issue 4 years ago • 2 comments

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

pranil-19 avatar Oct 10 '21 07:10 pranil-19

@arnab2001 please assign this to me

Saurabhsahab avatar Oct 22 '21 15:10 Saurabhsahab

Hello, Can you please assign this issue to me?

CODER-AsHuToSh avatar Oct 14 '22 09:10 CODER-AsHuToSh