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

            vector<vector<char>> v;  // Changed int to char for storing characters

    for (int i = 0; i < s.size(); ++i) {
        vector<char> v1;

        for (int j = i; j < s.size(); ++j) {
            // Check if the character is already in v1
            if (find(v1.begin(), v1.end(), s[j]) != v1.end()) {
                break;
            } else {
                v1.push_back(s[j]);
            }
        }

        v.push_back(v1);
    }

    // Find the longest vector in v
    size_t maxLength = 0;
    for (const auto& vec : v) {
        if (vec.size() > maxLength) {
            maxLength = vec.size();
        }
    }
        return maxLength;
    }
};
51081