<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 {
    bool isvalid(string s,int mid){
       for(int i=0;i<s.length()-mid+1;i++){
                map<char,int>m;
                // int r=
                for(int j=i;j<i+mid;j++){
                  m[s[j]]++;
                }
                if(m.size()==mid){
                    return true;
                }
       }
       return false;
    }
public:
    int lengthOfLongestSubstring(string s) {
        map<char,int>m;
        for(int i=0;i<s.length();i++){
            m[s[i]]++;
        }

        if(s.length()==m.size()){
            return s.length();
        }
        // cout<<m.size()<<endl;
        int l=1,r=m.size();
        long long ans=0;
        while(l<=r){
            int mid=(l+r)/2;
            cout<<mid<<endl;
            if(isvalid(s,mid)){
                ans=mid;
                l=mid+1;

            }
            else{
                r=mid-1;
            }
        }
        return ans;
    }
};
117054