Longest Substring Without Repeats | Dataford Interview Questions

Write a function to identify the longest substring without repeating characters.

Implement length_of_longest_substring(s), returning the length of the longest contiguous substring in string s that contains no repeated characters. Return 0 for an empty string. The expected solution should run in linear time.

Function Contract

Input: a string s
Output: an integer representing the maximum substring length

Constraints

0 <= len(s) <= 50000
s may contain lowercase letters, uppercase letters, digits, punctuation, and spaces
Characters are compared exactly, including case and whitespace

Function Signature

def length_of_longest_substring(s):

Your question is Longest Substring Without Repeats. 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