MediumTopic: Sliding WindowExpected: O(N) Time • O(min(N, M)) Space
Longest Substring Without Repeating Characters
Given a string `s`, find the length of the **longest substring** without repeating characters.
Examples
Input: s = "abcabcbb"
Output: 3
The answer is "abc", with the length of 3.
Input: s = "bbbbb"
Output: 1
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.
solution.js
JavaScript (ES6+)Test Execution Results
Input:
["abcabcbb"]Expected:
3Your Output:
--