Maximum Unique Substring Length

MEDIUM20 pts

Given a string s, determine the length of the longest contiguous substring that contains no repeating characters. A substring is defined as a contiguous sequence of characters within the string, and every character in the valid substring must be unique.

Your task is to efficiently identify the maximum length among all such substrings. If the string is empty, return 0. If the entire string consists of unique characters, return the length of the entire string.

Example

Input

s = "abcabcbb"

Output

3

Explanation

The longest substring without repeating characters is "abc", which has a length of 3. Other valid substrings of the same length include "bca" and "cab".

Example

Input

s = "bbbbb"

Output

1

Explanation

Since all characters are identical, the longest substring without repeating characters is just a single "b", giving a length of 1.

Example

Input

s = "pwwkew"

Output

3

Explanation

The longest substring without repeating characters is "wke" with length 3. Note that "pwke" is a subsequence (not contiguous) and therefore does not qualify as a valid answer.

Accepted0/0·0% Acceptance

Constraints

0 ≤ s.length ≤ 5 × 10⁴
s consists of English letters (both uppercase and lowercase), digits, symbols, and spaces.

Code

Visualizer

Solutions

14px

Test Cases3

Results

Submissions

s =

"abcabcbb"

Loading problem...

Maximum Unique Substring Length

Hints

Maximum Unique Substring Length

Hints