Description
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.
Examples
Input:
s = "abcabcbb"Output:
3Explanation:
The answer is "abc", with the length of 3.
Input:
s = "bbbbb"Output:
1Explanation:
The answer is "b", with the length of 1.
Input:
s = "pwwkew"Output:
3Explanation:
The answer is "wke", with the length of 3.
Constraints
- •
0 ≤ s.length ≤ 5 × 10⁴ - •
s consists of English letters, digits, symbols and spaces.