Open prerna-rn opened 9 months ago
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/
@bh-g please assign to me
@bh-g Please assign this ques to me...
Please assign this issue to me.. @bh-g
Please assign it to me @bh-g
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:
https://leetcode.com/problems/palindrome-partitioning-ii/description/