Palindrome Partitioning (CPP)

[pranil-19]

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

[i-s0nic]

@arnab2001 please assign this to me

[CODER-AsHuToSh]

Hello, Can you please assign this issue to me?