Longest Substring Without Repeating Characters
Given a string s, find the length of the longest substring without repeating characters.
Examples
"abcabcbb" → 3 ("abc")
"bbbbb" → 1 ("b")
"pwwkew" → 3 ("wke")
"" → 0
" " → 1
"au" → 2