Interview Guides

Given a string s, return the length of the longest substring that contains no repeated characters. A substring must be contiguous. The input is a string, and the output is a single integer.
0 <= len(s) <= 5 * 10^4s consists of English letters, digits, symbols, and spacesO(n) solution is expected