Problem

In Messenger, you need to analyze a typed message and find the length of the longest contiguous substring that contains no repeated characters.

Write a function that takes a string s and returns an integer: the maximum length of any substring of s with all unique characters.

Formal Specification

• Input: A string s
• Output: An integer representing the length of the longest substring without repeating characters

Examples

Example 1

• Input: s = "abcabcbb"
• Output: 3
• Explanation: The longest substrings without repeated characters are "abc", "bca", and "cab", each of length 3.

Example 2

• Input: s = "bbbbb"
• Output: 1
• Explanation: Every substring longer than length 1 repeats the character b, so the best answer is "b".

Example 3

• Input: s = "pwwkew"
• Output: 3
• Explanation: "wke" is a valid substring of length 3. "pwke" is not valid because it is not contiguous.

Constraints

• 0 <= len(s) <= 5 * 10^4
• s contains English letters, digits, symbols, and spaces
• The solution should run efficiently for long strings