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

Find the length of the longest substring without repeating characters.

Implement longest_substring_length(s), where s is a string, and return an integer representing the maximum length of any substring containing no repeated characters. The substring must use consecutive characters, and an empty string should return 0.

Function signature: def longest_substring_length(s):

Constraints

0 <= len(s) <= 5 * 10^4
s may contain letters, digits, symbols, and spaces
Characters are compared exactly, including case and whitespace

Function Signature

def longest_substring_length(s):

Your solutionPython 3

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

Run your code to see test output