<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) 
    {
        if(s.size()==0)
          return 0;
        map<char,int>mp;
        map<char,int>::iterator it;
        int i,max=1;
        for(i=0;i<s.size();i++)
        {
            if(mp.find(s[i])==mp.end())
                mp.insert({s[i],i});
            else
               mp[s[i]]=i;
                int count=1;
                vector<int>v;
                for(it=mp.begin();it!=mp.end();it++)
                  v.push_back(it->second);
                sort(v.begin(),v.end());
                for(int j=0;j<v.size()-1;j++)
                if(v[j]+1==v[j+1])
                  count++;
                else
                  count=1;
                if(count>max)
                  max=count;
        }
        return max;
    }
};
84068