<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>


constexpr auto noneEqual(char symb)
{
    return [=](char s)
    {
        return s == symb;
    };
}

class Solution {
public:
    int lengthOfLongestSubstring(std::string s) {
        size_t counter{};
        for (size_t indx = 0; indx < s.size(); ++indx)
        {
            std::vector<char> buff{};
            buff.reserve(s.size());
            for (size_t tmpIndx = indx; tmpIndx < s.size(); ++tmpIndx)
            {
                const char symb = s[tmpIndx];
                if(std::ranges::any_of(buff, noneEqual(symb)))
                {
                    break;
                }
                buff.push_back(symb);
            }
            if(buff.size() > counter)
            {
                counter = buff.size();
            }
        }

        return counter;
    }
};
   
120053