Longest Substring Without Repeating Characters
MediumProblem Description
Given a string s, return the length of the longest substring without repeating characters.
Examples
Example 1:
Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with length 3.
Example 2:
Input: s = "bbbbb"
Output: 1
Explanation: The answer is "b", with length 1.
Example 3:
Input: s = "pwwkew"
Output: 3
Explanation: The answer is "wke", with length 3.
Constraints
0 <= s.length <= 5 * 10^4sconsists of English letters, digits, symbols, and spaces.
Follow-up
Can you solve this in O(n) time?
Solution
Test Results
Run tests to see the overall score, band, and section breakdown.
Public Tests
Detailed feedback for visible cases.
Public test details will appear here after you run your solution.
Hidden Tests
Summary only, with no hidden inputs or outputs.
Performance
Execution timing and pass/fail status.
No performance results yet.
AI Interviewer
I'll review your code once you submit it. I can also give you hints if you get stuck!