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

Solve a problem that requires you to find the longest substring without repeating characters.

Implement length_of_longest_substring(s), which accepts a string and returns the length of its longest contiguous substring containing no repeated characters. Return 0 for an empty string. Characters are case-sensitive, so A and a are different.

Constraints

0 <= s.length <= 5 * 10^4
s contains printable or Unicode characters
Character comparisons are case-sensitive
The substring must be contiguous

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