Longest Substring Without Duplicates | Dataford Interview Questions

Given a string s, find the length of the longest substring without duplicate characters.

Implement length_of_longest_substring(s). Return an integer representing the maximum length. A substring must contain contiguous characters, and the comparison is case-sensitive.

Input and Output

Input: a string s.
Output: the length of the longest substring with no repeated characters.

Constraints

0 <= len(s) <= 5 * 10^4
s may contain any printable or Unicode characters
Character comparison is case-sensitive

Function Signature

def length_of_longest_substring(s):

Your question is Longest Substring Without Duplicates. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem