Longest Substring Without Repeats

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Longest Substring Without Repeats. Start with the requirements on the right.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

You need to log in / sign up to run or submit.

Problem

How would you find the length of the longest substring without repeating characters?

Implement length_of_longest_substring(s), which accepts a string and returns the maximum length of a contiguous substring containing no repeated characters. Use an efficient approach suitable for strings up to 50,000 characters.

Constraints

0 <= len(s) <= 50000
s may contain lowercase letters, uppercase letters, digits, spaces, and punctuation
Return an integer representing the maximum substring length

Function Signature

def length_of_longest_substring(s):

Your solutionPython 3

You need to log in / sign up to run or submit.

Run your code to see test output