Longest Unique Character Substring

MediumPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Longest Unique Character Substring. 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

Given a string s, return the length of the longest substring that contains no repeated characters. A substring is a contiguous sequence of characters within the string. The input is a string, and the output is a single integer.

Constraints

0 <= len(s) <= 5 * 10^4
s consists of English letters, digits, symbols, and spaces
A valid solution should run in linear time

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