Longest Substring Without Repeating Characters II

Given a string s, determine the length of its longest substring that contains no repeated characters.

A substring is a consecutive run of characters taken from within a string.

Examples

Example 1:

Input: s = "zxyzxyz"

Output: 3

Explanation:

"xyz" is the longest substring whose characters are all distinct.

Example 2:

Input: s = "xxxx"

Output: 1

Constraints

• 0 <= s.length <= 1000
• s may contain printable ASCII characters.