<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) {
        int substrL = 0;
        
        map<char, int> charsCount;
        for (int i = 0; i < s.length(); i++) {
            if (charsCount[s[i]] == 0) {
                substrL++;
            }

            charsCount[s[i]]++;
        }
        
        while (substrL >= 1) {
            //int hopeFor = result;
            int maxIndex = s.length() - substrL;

            for (int i = 0; i <= maxIndex; i++) {
                map<char, int> charsCount;
                //cout<<"inserting: ";
                for (int j = i; j < i + substrL; j++) {
                    //cout<<s[j]<<" ";
                    //chars.insert(s[j]);
                    if (charsCount[s[j]] > 0) {
                        charsCount.clear();
                        break;
                    }

                    charsCount[s[j]]++;
                }

                if (charsCount.size() == substrL) {
                    return substrL;
                }
                //cout<<"finished inserting."<<endl;
                //cout<<endl;

                // chars.clear();
            }

            substrL--;
        }

        return 0;
    }
};
213014