Practice
Learn
← Quit
0 / 0 correct
Algorithms
Medium
1 of 10
What technique finds the longest substring without repeating characters in O(n)?
A
Divide and conquer
B
A sliding window with a map of each character's last seen index
C
Sorting the string
D
Brute force over all substrings