Longest Substring Coding | Dataford Interview Questions

How would you approach finding the longest substring within a given string?

Implement the solution by returning the length of the longest substring that contains no repeated characters. The substring must be contiguous, and an empty input must return 0.

Input: A string s. Output: An integer representing the maximum valid substring length.

Constraints

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

Function Signature

def longest_unique_substring(s):

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