Longest Substring Without Repeating Characters
00:00
Given a string s, find the length of the longest substring without repeating characters.
Example:
Input: s = "abcabcbb"
Output: 3 (The answer is "abc", with the length of 3).
Examples
Input → abcabcbb
Output → 3
Input → bbbbb
Output → 1
Input → pwwkew
Output → 3