Longest Substring Without Repeats

MediumPython

Problem

Solve a problem that requires you to find the longest substring without repeating characters.

Implement length_of_longest_substring(s), which accepts a string and returns the length of its longest contiguous substring containing no repeated characters. Return 0 for an empty string. Characters are case-sensitive, so A and a are different.

Constraints

0 <= s.length <= 5 * 10^4
s contains printable or Unicode characters
Character comparisons are case-sensitive
The substring must be contiguous

Function Signature

def length_of_longest_substring(s):

CodePython 3

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

Run your code to see test output here.