Skip to content
6
0
:
0
0

Longest Substring Without Repeating Characters

Medium

Sliding Window

Given a string s, find the length of the longest substring without repeating characters.

Example 1

Input:s = "abcabcbb"
Output:3

The answer is "abc", with the length of 3.

Example 2

Input:s = "bbbbb"
Output:1

The answer is "b", with the length of 1.

Constraints

  • 0 <= s.length <= 5 * 104
  • s consists of English letters, digits, symbols and spaces.
solution.js
Loading...

Test Cases (2)

Test Case 1
Input:
"abcabcbb"
Expected Output:
3
Test Case 2
Input:
"bbbbb"
Expected Output:
1