Longest Substring Without Repeating Characters

Medium

Given a string s, find the length of the longest substring without repeating characters.

Example 1

Input:  s = "abcabcbb"
Output: 3
Explanation: The answer is "abc".

Example 2

Input:  s = "bbbbb"
Output: 1

Constraints

• 0 <= s.length <= 5*10^4
• s consists of English letters, digits, symbols and spaces.