<p>Given a string <code>s</code>, find the length of the <strong>longest</strong> <span data-keyword="substring-nonempty"><strong>substring</strong></span> without repeating characters.</p>

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

<pre>
<strong>Input:</strong> s = &quot;abcabcbb&quot;
<strong>Output:</strong> 3
<strong>Explanation:</strong> The answer is &quot;abc&quot;, with the length of 3.
</pre>

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

<pre>
<strong>Input:</strong> s = &quot;bbbbb&quot;
<strong>Output:</strong> 1
<strong>Explanation:</strong> The answer is &quot;b&quot;, with the length of 1.
</pre>

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

<pre>
<strong>Input:</strong> s = &quot;pwwkew&quot;
<strong>Output:</strong> 3
<strong>Explanation:</strong> The answer is &quot;wke&quot;, with the length of 3.
Notice that the answer must be a substring, &quot;pwke&quot; is a subsequence and not a substring.
</pre>

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

<ul>
	<li><code>0 &lt;= s.length &lt;= 5 * 10<sup>4</sup></code></li>
	<li><code>s</code> consists of English letters, digits, symbols and spaces.</li>
</ul>

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        string newStr = "";
        bool inCurr = false;
        // >> looked up ** vectors vs arrays??
        vector<string> allStrs;
        int lastInst;
        for(int i = 0; i < s.size(); i++){
            inCurr = false;
            if(newStr.size() == 0){
                newStr += s[i];
            }
            else{
                for(int j = 0; j < newStr.size(); j++){
                    if(s[i] == newStr[j]){
                        inCurr = true;
                        lastInst = j;
                    }
                }
                if(inCurr){
                    string newStr2 = "";
                    allStrs.push_back(newStr);
                    for(int k = lastInst + 1; k < newStr.size(); k++){
                        newStr2 += newStr[k];
                    }
                    newStr = newStr2;
                }
                newStr += s[i];
            }
        }
        allStrs.push_back(newStr);
        string finalStr = "";
        for(int i = 0; i < allStrs.size(); i++){
            if(i == 0){
                finalStr = allStrs[i];
                std::cout << finalStr << std::endl;
                continue;
            }
            if(allStrs[i].length() > finalStr.length()){
                finalStr = allStrs[i];
            }
        }
        std::cout << finalStr << std::endl;
        return finalStr.length();
    }
};
33089