Day-26/q1: Palindrome Partitioning II

[prerna-rn]

Given a string s, partition s such that every substring of the partition is a palindrome.

Return the minimum cuts needed for a palindrome partitioning of s.

Example 1:

Input: s = "aab"
Output: 1
Explanation: The palindrome partitioning ["aa","b"] could be produced using 1 cut.

Example 2:

Input: s = "a"
Output: 0

Example 3:

Input: s = "ab"
Output: 1

Constraints:

1 <= s.length <= 2000
s consists of lowercase English letters only.

https://leetcode.com/problems/palindrome-partitioning-ii/description/

[Kalpana8055]

@bh-g please assign to me

[Tech-neophyte]

@bh-g Please assign this ques to me...

[Anomasingh]

Please assign this issue to me.. @bh-g

[avanimathur]

Please assign it to me @bh-g