<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>

bool valid(vector<char> arr, char s){
    for(int i = 0 ; i < arr.size(); i++){
        if(arr[i] == s)
            return false;
    }
    return true;

}
class Solution {
public:
    int lengthOfLongestSubstring(string s) {

    vector<char>* arr = new vector<char>;
    vector<int> sizes;

    for (int i = 0; i < s.length(); i++) {
        if (valid(*arr, s[i])) {
            arr->insert(arr->end(), s[i]);
        }
        else {
            sizes.insert(sizes.end(), arr->size());
            vector<char> temp;
            bool allowed = false;
            
            for(int j = 0; j < arr->size(); j++){
                if((*arr)[j] == s[i]){
                    allowed = true;
                }
                else if(allowed){
                    temp.insert(temp.end(),(*arr)[j]);
                }
            }
            arr = new vector<char>;
            for(int j = 0; j < temp.size(); j++){
                arr->insert(arr->end(),temp[j]);
            }

            arr->insert(arr->end(), s[i]);
        }
    }
    sizes.insert(sizes.end(), arr->size());

    int max = sizes[0];
    for (int i = 0; i < sizes.size(); i++) {
        if (max < sizes[i]) {
            max = sizes[i];
        }
    }
    return max;
}
};
60078