DeepFrontend
Learning Paths
Practice
System Design & DS
Design Studio
Data Structures Curriculum
Real-World Case Studies
Careers
Job Board
Resume Builder
Blog
Sign in
Search
⌘K
Go Pro
Loading compiler resources...
Interview Prep Quiz Practice
Active Recall Drill Session
← Exit Session
Question 1 of 1
medium
Interview Prep
What's the complexity of the sliding-window 'longest substring without repeating characters' solution shown in the Concept section?
A
O(n²)
B
O(n)
C
O(n log n)
D
O(1)
Check Answer