The problem. Given a string s, return the length of the longest substring (consecutive characters) in which no character repeats.
s = "abcabcbb" -> 3 ("abc")
s = "bbbbb" -> 1 ("b")
s = "pwwkew" -> 3 ("wke")
s = "" -> 0Free account
Sign up to read the rest of this lesson: 6 more sections, 3 drawings, a dry-run simulator and code in JavaScript, Python, Java and C++.
Still to come