<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:
    bool isCharacterExist(unordered_map<char,int> vis, char ch) {
        if (vis.find(ch) == vis.end()) return false;
        return true;
    }

    int lengthOfLongestSubstring(string s) {
        queue<char> q;
        int answer = 0;
        unordered_map<char, int> vis;
        for (char ch : s) {
            if (q.empty()) {
                q.push(ch);
                vis[ch] = 1;
                answer = 1;
            }
            else {
                if (!isCharacterExist(vis,ch)) {
                    q.push(ch);
                    vis[ch] = 1;
                }
                else {
                    while (q.front() != ch) {
                        vis.erase(q.front());
                        q.pop();

                    }
                    q.pop();
                    q.push(ch);
                }
                if (q.size() > answer) answer = q.size();
            }
        }
        return answer;
    }
};
213014