Longest Substring without Repeating Characters
Find the length of the longest substring of a given string without repeating characters.
Input: abccabcabcc
Output: 3
Explanation: longest substrings are abc
, cab
, both of length 3
Input: aaaabaaa
Output: 2
Explanation: ab
is the longest substring, length 2