0003. Longest Substring Without Repeating Characters
Medium ā Hash Table, String, Sliding Window
ā 0002. Add Two Numbers
0004. Median of Two Sorted Arrays ā
Brute Force
Sliding Window (Set)
Sliding Window (Map)
Apply
š² Generate
Length:
6
10
15
20
Presets:
abcabcbb
bbbbb
pwwkew
(empty)
▶ Play
▮▮ Pause
⏭ Step
↺ Reset
Speed:
Slow
Normal
Fast
Very Fast
▶ Press "Play" or use "Step" to walk through step by step.
Step
0 / 0
Operations
0
Time
—
Space
—
Default
Left Ptr
Right Ptr
Window
Duplicate
Best
Algorithm Complexity
Brute Force O(nĀ³)
O(nĀ³)
O(nĀ³) / O(min(n,m))
Sliding Window + Set
O(n)
O(n) / O(min(n,m))
Optimal HashMap
O(n)
O(n) / O(min(n,m))