Longest Substring Without Repeating Characters | CodeForge AI

Longest Substring Without Repeating CharactersMedium

Sign in to solve

Longest Substring Without Repeating Characters

MediumSliding Window

Given a string s, find the length of the longest substring without repeating characters.

Input:

The first line contains the string s.

Output:

The length of the longest substring without repeating characters.

Example:

Input: abcabcbb
Output: 3

Example 1

Input: abcabcbb

Output: 3

The longest substring without repeating characters is 'abc'.

Constraints

1 <= s.length <= 10^5
s consists of English letters, digits, symbols and spaces.

Hints

stringsliding window

Sign in to run code

Run your code to see test results here.

Longest Substring Without Repeating Characters

MediumSliding Window

Given a string s, find the length of the longest substring without repeating characters.

Input:

The first line contains the string s.

Output:

The length of the longest substring without repeating characters.

Example:

Input: abcabcbb
Output: 3

Example 1

Input: abcabcbb

Output: 3

The longest substring without repeating characters is 'abc'.

Constraints

1 <= s.length <= 10^5
s consists of English letters, digits, symbols and spaces.

Hints

stringsliding window