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.

Given a string s, return the length of the longest substring that contains no repeated characters.

A substring is a contiguous sequence of characters. If the string is empty, return 0.

Write a function that takes a single string input and returns an integer length.

0 <= len(s) <= 5 * 10^4
s may contain lowercase letters, uppercase letters, digits, spaces, and punctuation
Return the length of the longest substring without repeating characters

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