<p>Given a string <code>s</code>, partition the string into one or more <strong>substrings</strong> such that the characters in each substring are <strong>unique</strong>. That is, no letter appears in a single substring more than <strong>once</strong>.</p>

<p>Return <em>the <strong>minimum</strong> number of substrings in such a partition.</em></p>

<p>Note that each character should belong to exactly one substring in a partition.</p>

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

<pre>
<strong>Input:</strong> s = &quot;abacaba&quot;
<strong>Output:</strong> 4
<strong>Explanation:</strong>
Two possible partitions are (&quot;a&quot;,&quot;ba&quot;,&quot;cab&quot;,&quot;a&quot;) and (&quot;ab&quot;,&quot;a&quot;,&quot;ca&quot;,&quot;ba&quot;).
It can be shown that 4 is the minimum number of substrings needed.
</pre>

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

<pre>
<strong>Input:</strong> s = &quot;ssssss&quot;
<strong>Output:</strong> 6
<strong>Explanation:
</strong>The only valid partition is (&quot;s&quot;,&quot;s&quot;,&quot;s&quot;,&quot;s&quot;,&quot;s&quot;,&quot;s&quot;).
</pre>

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

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

class Solution {
public:
int partitionString(std::string s) {
        std::unordered_set<std::string> store;
        std::string temp;
        auto counter = 0;
        auto result = 0;
        while (counter < s.length()) {
            bool arr[26]={0};
            auto j=counter;
            for (;j<s.length(); ++j) {
               auto ch = s[j]; 
               temp.push_back(ch);
               //std::cout << "ch : " << ch << "|temp:" << temp  << "|counter " << counter << std::endl;
               if (arr[ch-'a']) {
                temp.pop_back();
                if (!temp.empty()) {
                   //std::cout << "Found : " << temp << std::endl;
                   result++;
                   store.emplace(temp); 
                   temp.clear();
                }
                break;
               }
               arr[ch-'a'] = true;
            } 
            counter = j;
        }
        
        if (!temp.empty()) {
            result++;
        }
        //std::cout << "Result : " << result << std::endl;        
        return result;    
    }
};
27381