<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 {
public:
    map<pair<int,int>, int> m;
    int SolveStrangePrint(string& s, int left, int right) {
        if(left==right)
            return 1;
        if(left>right)
            return 0;
        if(m[{left,right}])
            return(m[{left,right}]);
        int i=left;
        while(s[i]==s[left]) {
            i++;
        }
        int normal = 1+SolveStrangePrint(s, i,right);
        int optimum = INT_MAX;
        for(int j=i;j<=right;j++) {
            if(s[left]==s[j]) {
                optimum = min(optimum, SolveStrangePrint(s, i,j-1)+SolveStrangePrint(s,j,right));
            }
        }
        m[{left,right}] = min(normal,optimum);
        return min(normal,optimum);
    }
    int strangePrinter(string s) {
        return SolveStrangePrint(s,0,s.length()-1);
        
    }
};
23062