Longest Substring Without Repeats | Dataford Interview Questions

What is the longest substring without repeating characters?

Implement length_of_longest_substring(s) to return the length of the longest contiguous substring in which every character appears at most once. Return 0 for an empty string. The solution should run in linear time.

Function signature: length_of_longest_substring(s)

Input is a string, and output is an integer.

Constraints

0 <= len(s) <= 50000
s contains printable ASCII characters
The substring must be contiguous

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