Longest Substring Without Repeats

Difficulty: 1400 2000 ms 128 MB

strings two-pointers

Find the length of the longest substring of S in which no character appears twice.

Input: one line with the string S.

Output: the maximum length of a repeat-free substring.

Constraints:

• 1 ≤ |S| ≤ 10⁴
• S contains lowercase English letters

Sample Tests

abcabcbb

3

bbbb

1

Read the Editorial