Longest Substring Without Repeating Characters (LeetCode Medium) #8502
Description
Problem Title: Longest Substring Without Repeating Characters (LeetCode Medium)
Problem Statement:
- Given a string s, find the length of the longest substring that does not contain any repeating characters.
- A substring is a contiguous sequence of characters within a string.
- Your task is to return the length of the longest substring that contains all unique characters.
Examples:
Example 1:
Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.
Example 2:
Input: s = "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.
Constraints
0 <= s.length <= 5 * 10^4
"s" consists of English letters, digits, symbols, and spaces.
Language: Python