<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(string s) {
        
        std::vector<std::string> partitions;
        std::string substring;
        std::unordered_set<char> distinct_set;

        // Iterate through string
        for(std::string::size_type i = 0; i<s.size(); i++) {
        // for(char c : s) {
            char c = s[i];

            bool distinct = !distinct_set.contains(c);

            // If it is distinct, append to substring
            if(distinct) {
                substring += c;
                distinct_set.insert(c);
            } else {
                // Otherwise, append the current substring to partitions, and create a new substring
                partitions.push_back(substring);
                substring.clear();
                distinct_set.clear();
                substring += c;
                distinct_set.insert(c);
                // if(i == s.size()-1) {
                //     partitions.push_back(substring);
                // }

            }


            
        }
        partitions.push_back(substring);
        // Print partition for debug
        std::cout << std::endl;
        for(std::string str : partitions) {
            std::cout << " ";
            for(char c : str) {
                std::cout << c;
            }
        }
        return partitions.size();
        
    }





};
59931