We’re preparing your current view and syncing the latest data.
Given a string s, find the length of the longest substring without repeating characters. A substring is a contiguous sequence of characters within the string. You need to identify the longest substring in the input string that contains no duplicate characters and return its length.
A single string s consisting of English letters, digits, symbols, and spaces.
An integer representing the length of the longest substring without repeating characters.
0 <= s.length <= 5 * 10^4
Example 1
Input
abcabcbb
Output
3
Explanation
The answer is 'abc', with the length of 3.
Example 2
Input
bbbbb
Output
1
Explanation
The answer is 'b', with the length of 1.
Example 3
Input
pwwkew
Output
3
Explanation
The answer is 'wke', with the length of 3. Note that the answer must be a substring, 'pwke' is a subsequence and not a substring.