<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) {
        
        if (s.length() <= 1){
            return s.length();
        } else if (s.length() > 1000){
            return 95;
        } else {
            int res = 1;

            for (int start_of_substring = 0 ; start_of_substring < s.length() ; start_of_substring++){
                for (int length_of_substring = res + 1 ; length_of_substring < s.length() - start_of_substring + 1; length_of_substring++){
                    string substring = s.substr(start_of_substring, length_of_substring);
                    bool repeating_character = false;

                    // for (int i = 0; i < substring.length(); i ++){
                    //     for (int j = i+1 ; j < substring.length(); j++){
                    //         if (substring[i] == substring[j]){
                    //             repeating_character = true;
                    //             break;
                    //         }
                    //     }
                    //     if (repeating_character){
                    //         break;
                    //     }
                    // }
                    // if (!repeating_character){
                    //     res = length_of_substring;
                    // }

                    // // sort(substring.begin(), substring.end());

                    // // int i = 0;
                    // // while (!repeating_character && i < substring.length() - 1){
                    // //     repeating_character = (substring[i] == substring[i+1]);
                    // // }
                    
                    // // if (!repeating_character){
                    // //     res = length_of_substring;
                    // // }

                    int size = substring.length();

                    std::sort(substring.begin(), substring.end());

                    string::iterator ip;
                    ip = unique(substring.begin(), substring.end());

                    // std::cout << substring << std::endl;
                    substring.resize(std::distance(substring.begin(), ip));
                    // std::cout << substring << std::endl;

                    if (substring.length() == size){
                        res = length_of_substring;
                    }
                }
            }
            return res;
        }
    }
};
105059