Longest Substring Without Repeats | Dataford Interview Questions

Longest Substring Without Repeating Characters.

Asked in the phone screen stage. Given a string s, return the length of its longest substring containing no repeated characters. Reported follow-ups include returning the first or last matching substring, or returning all longest matches.

Input and Output

Implement length_of_longest_substring(s), where s is a string and the output is an integer.

Examples:

s = "abcabcbb" returns 3, from "abc".
s = "bbbbb" returns 1, from "b".

Constraints: 0 <= len(s) <= 5 * 10^4. Characters may be any valid string characters.

Constraints

0 <= len(s) <= 5 * 10^4
s may contain any valid string characters
Return only the maximum length, not the substring itself

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