Problem

In Meta Messenger, you need to analyze a text string 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 in which every character appears at most once.

Input and Output

• 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 substring without repeating characters is "abc", which has length 3.

Example 2

• Input: s = "bbbbb"
• Output: 1
• Explanation: Every substring longer than 1 contains a repeated "b", so the best answer is 1.

Example 3

• Input: s = "pwwkew"
• Output: 3
• Explanation: One valid longest substring is "wke". Note that "pwke" is not contiguous, so it does not count.

Constraints

• 0 <= len(s) <= 5 * 10^4
• s consists of English letters, digits, symbols, and spaces
• The solution should run efficiently for large inputs