21. Longest Substring Without Repeating Characters
Given a string s, return the length of its longest substring without repeating characters.
Example 1:
Input: s = "abcabcbb" Output: 3
Example 2:
Input: s = "bbbbb" Output: 1
Constraints:
0 <= s.length <= 5 * 10^4