<p>Given a string <code>s</code>, partition <code>s</code> such that every <span data-keyword="substring-nonempty">substring</span> of the partition is a <span data-keyword="palindrome-string">palindrome</span>.</p>

<p>Return <em>the <strong>minimum</strong> cuts needed for a palindrome partitioning of</em> <code>s</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aab&quot;
<strong>Output:</strong> 1
<strong>Explanation:</strong> The palindrome partitioning [&quot;aa&quot;,&quot;b&quot;] could be produced using 1 cut.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;a&quot;
<strong>Output:</strong> 0
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;ab&quot;
<strong>Output:</strong> 1
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 2000</code></li>
	<li><code>s</code> consists of lowercase English letters only.</li>
</ul>

class Solution:
    def minCut(self, s: str) -> int:
        if s==s[::-1]: return 0

        for i in range(len(s)):
            if s[:i]==s[:i][::-1] and s[i:]==s[i:][::-1]: return 1
        
        d=[[0]*len(s) for _ in range(len(s))]
        
        for i in range(len(s)):
            for j in range(i,len(s)):
                st=s[i:j+1]
                d[i][j]=(st==st[::-1])
        
        cuts = list(range(len(s)))

        for i in range(1,len(s)):
            if d[0][i]:
                cuts[i]=0
            else:
                for j in range(0,i):
                    if d[j+1][i]:
                        cuts[i]=min(cuts[i],cuts[j]+1)
        return cuts[-1]


        
40183