Longest Substring Without Repeating Characters
Given a string s, find the length of the longest substring without repeating characters.

30:00

Longest Substring Without Repeating Characters
medium
Topics
Companies

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

Example 1:
Input: "abcabcbb"
Output: 3
Constraints:

  • 0≤s.length≤5×1040 \leq s.\text{length} \leq 5 \times 10^4

  • s consists of English letters, digits, symbols, and spaces.

Input
arr ="abcabcbb"

a

L

b

c

a

b

c

b

b

Window Set

Empty

Max Length

0

Variables
No variables to display
DepthFunction Call
Stack empty
0/39