Longest Substring Without Repeating Characters

Moderate

0/80

Average time to solve is 30m

Contributed by

92 upvotes

+37 more companies

Problem statement

Given a string input of length n, find the length of the longest substring without repeating characters i.e return a substring that does not have any repeating characters.

Substring is the continuous sub-part of the string formed by removing zero or more characters from both ends.

Detailed explanation ( Input/output format, Notes, Images )

Input format:

 The first and the only line consists of a string of length n containing lowercase alphabets.

Output format:

 You need to print the length of the longest unique characters substring.

Constraints:

 1<= n <=10^5

Time Limit: 1 sec

Sample Input 1:

abcabcbb

Sample Output1:

Explanation For Sample Input 1:

Substring "abc" has no repeating character with the length of 3.

Sample Input 2:

 aaaa

Sample Output 2:

Console