<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:
    void printDeque(const deque<char>& s) {
        std::cout << "Deque: ";
        for(auto c: s) {
            std::cout << c;
        }
        
        std::cout << std::endl;
    }
    
    bool isStringInside(const deque<char>& s, char nextChar) {
        for (auto c: s) {
            if (c == nextChar) {
                return true;
            }
        }
        
        return false;
    }
    
    deque<char> getNonRepeatedData(const deque<char>& s, char nextChar) {
        deque<char> nextDeque = s;
        while (nextDeque.size()) {
            const auto firstSign = nextDeque.front();
            nextDeque.pop_front();
            if (firstSign == nextChar) {
                nextDeque.push_back(nextChar);
                
                return nextDeque;
            }
        }
        
        nextDeque.push_front(nextChar);
        
        return nextDeque;
    }
    
    // 1 in: v
    //   ls: dv
    //   ts: dv
    // 2 in: d
    //   ls: 
    //   ts: 
    int lengthOfLongestSubstring(string s) {
        if (s.empty()) {
            return 0;
        }
        
        deque<char> longestSubstring;
        longestSubstring.push_front(s.c_str()[0]);
        auto tempStr = longestSubstring;
        for (auto i = 1; i < s.size(); i++) {
            printDeque(tempStr);
            const auto currentChar = s.data()[i];
            if (isStringInside(tempStr, currentChar)) {
                if (longestSubstring.size() < tempStr.size()) {
                    longestSubstring = tempStr;
                }
                
                tempStr = getNonRepeatedData(tempStr, currentChar);
                
                continue;
            }
            
            tempStr.push_back(currentChar);
        }
        
        if (longestSubstring.size() < tempStr.size()) {
            longestSubstring = tempStr;
        }
        
        return longestSubstring.size();
    }
};
51081