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