<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 n = s.size();
        vector pref(n + 1, vector<int>(200, 0));
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < 200; j++)
            {
                pref[i + 1][j] = pref[i][j];
            }
            pref[i + 1][int(s[i])]++;
        }
        int mx = 0;
        for(int l = 0, r = 1; r <= n;)
        {
            bool can = true;
            for(int j = 0; j < 200; j++)
            {
                can &= (pref[r][j] - pref[l][j]) <= 1;
            }
            if(can)
            {
                mx = max(mx, r - l);
                r++;
            }
            else
            {
                l++;
            }
        }

        return mx;
    }
};
108058