<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) {
        int n = s.size();
        vector < vector<bool>>a(n, vector<bool>(n,0));
        for (int i = 0; i < n; i++)a[i][i] = 1;
         
        for (int di = 1; di <= n - 1; di++) {
            bool all_is_0=0;
            for (int i = 0; i <= n - 1 - di; i++) {
                all_is_0 += (a[i][di + i] = (s[i] != s[i + di] && a[i][i + di - 1] && a[i + 1][i + di]));
                
            }
            if (!all_is_0)return di;
        }
        return n;
    }
    
};
159036