<p>There is a strange printer with the following two special properties:</p>

<ul>
	<li>The printer can only print a sequence of <strong>the same character</strong> each time.</li>
	<li>At each turn, the printer can print new characters starting from and ending at any place and will cover the original existing characters.</li>
</ul>

<p>Given a string <code>s</code>, return <em>the minimum number of turns the printer needed to print it</em>.</p>

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

<pre>
<strong>Input:</strong> s = &quot;aaabbb&quot;
<strong>Output:</strong> 2
<strong>Explanation:</strong> Print &quot;aaa&quot; first and then print &quot;bbb&quot;.
</pre>

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

<pre>
<strong>Input:</strong> s = &quot;aba&quot;
<strong>Output:</strong> 2
<strong>Explanation:</strong> Print &quot;aaa&quot; first and then print &quot;b&quot; from the second place of the string, which will cover the existing character &#39;a&#39;.
</pre>

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

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

class Solution:
    def strangePrinter(self, s: str) -> int:
    
        dp = [[-1]*101 for _ in range(101)]
        def solve(l,r,d):
            if l>r:
                return 0
            if dp[l][r]!=-1:
                return dp[l][r]
            ans = 1+solve(l+1,r,d+1)
            
            
            for m in range(l+1,r+1):
                if s[l]==s[m]:
                    ans = min(ans,solve(l,m-1,d+1)+solve(m+1,r,d+1))
                
            dp[l][r] = ans
            return ans
        
        i = 0
        news = ""
        while i<len(s):
            news += s[i]
            j = i+1
            while j<len(s) and s[j]==s[i]:
                j+=1
            i=j
        s = news
        #print(s)
        return solve(0,len(s)-1,0)
            
18100