https://github.com/mbeps/longest_substring
3. Longest Substring Without Repeating Characters
https://github.com/mbeps/longest_substring
leetcode-python leetcode-solutions
Last synced: 4 days ago
JSON representation
3. Longest Substring Without Repeating Characters
- Host: GitHub
- URL: https://github.com/mbeps/longest_substring
- Owner: mbeps
- License: mit
- Created: 2023-06-07T13:43:59.000Z (about 3 years ago)
- Default Branch: master
- Last Pushed: 2023-06-12T11:55:03.000Z (about 3 years ago)
- Last Synced: 2026-04-06T14:25:51.315Z (3 months ago)
- Topics: leetcode-python, leetcode-solutions
- Language: Python
- Homepage: https://leetcode.com/problems/longest-substring-without-repeating-characters/
- Size: 5.86 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# **3. Longest Substring Without Repeating Characters**
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 * 104`
- `s` consists of English letters, digits, symbols and spaces.