Career Tracks
Exams
MCQ
Companies
Opportunities
Challenges
Pricing
MCQ Practice
Data Structures
Two Pointers & Sliding Window
Question
Medium
tcs-nqt
Sliding window approach to find longest substring without repeating characters has time complexity:
A
O(n²)
B
O(n × alphabet_size)
C
O(n)
D
O(n log n)
Show Answer
← Back to Two Pointers & Sliding Window questions
Sliding window approach to find longest substring without repeating characters has time complexity: | Two Pointers & Sliding Window MCQ | TomoLink | TomoLink
