| English | 简体中文 |
3. Longest Substring Without Repeating Characters
Description
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", with the length of 3.
Example 2:
Input: s = "bbbbb" Output: 1 Explanation: The answer is "b", with the length of 1.
Example 3:
Input: s = "pwwkew" Output: 3 Explanation: The answer is "wke", with the length of 3. Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.
Constraints:
0 <= s.length <= 5 * 104sconsists of English letters, digits, symbols and spaces.
Related Topics
Similar Questions
- Longest Substring with At Most Two Distinct Characters
- Longest Substring with At Most K Distinct Characters
- Subarrays with K Different Integers
- Maximum Erasure Value
- Number of Equal Count Substrings
- Minimum Consecutive Cards to Pick Up
- Longest Nice Subarray
- Optimal Partition of String
- Count Complete Subarrays in an Array
- Find Longest Special Substring That Occurs Thrice II
- Find Longest Special Substring That Occurs Thrice I