Longest Substring Without Repeats

MediumPython

Given a string s, return the length of the longest substring that contains no repeated characters.

A substring is a contiguous sequence of characters. If the string is empty, return 0.

Write a function that takes a single string input and returns an integer length.

0 <= len(s) <= 5 * 10^4
s may contain lowercase letters, uppercase letters, digits, spaces, and punctuation
Return the length of the longest substring without repeating characters

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.