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 where you need to find the longest substring without repeating characters.

Implement def length_of_longest_substring(s):, which accepts a string and returns the length of its longest contiguous substring containing no repeated characters. Aim for an O(n) solution using a sliding window.

Constraints

0 <= len(s) <= 50000
s contains printable ASCII characters
The substring must be contiguous
Return only the maximum length, not the substring itself

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