Longest Unique Substring Window

EasyPython00:00

Practice interviewer

In session

5 left

00:00

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

Spotify tracks user activity strings where each character represents an event type. Given a string s, return the length of the longest substring without repeating characters.

A substring is a contiguous sequence of characters within the string. You must design an algorithm better than checking all possible substrings.

Formal Specification

Input: a string s
Output: an integer representing the maximum length of a substring of s that contains no duplicate characters

Constraints

0 <= len(s) <= 5 * 10^4
s consists of English letters, digits, symbols, and spaces
The answer must be computed in better than O(n^2) time for large inputs

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