#132

Palindrome Partitioning II

hard · verified · 36.7% accepted · 5,909 likes · top 14%

string · dynamic programming

⊣ practice⊣ quiz⊣ open on leetcode ↗

Description

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

Solution