String Processing Function | Dataford Interview Questions

Implement a string processing function with specific constraints.

Given a string s, return the length of its longest contiguous substring containing no repeated characters. The function must handle letters, digits, spaces, and symbols as distinct characters. Return 0 for an empty string.

Function: longest_unique_substring(s)

Examples: "abcabcbb" returns 3, and "bbbbb" returns 1.

Constraints: 0 <= len(s) <= 10^5; all input characters are valid string characters.

Constraints

0 <= len(s) <= 10^5
Input may contain letters, digits, spaces, and symbols
Characters are compared exactly and case-sensitively

Function Signature

def longest_unique_substring(s):

Your question is String Processing Function. 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