Longest Unique Token Span

EasyPython00:00

Practice interviewer

In session

5 left

00:00

Your question is Longest Unique Token Span. 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 contiguous substring that contains no repeated characters. The input is a single string, and the output is a single integer.

Constraints

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

Function Signature

def longest_unique_span(s):

Your solutionPython 3

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

Run your code to see test output