Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 327
How can the longest increasing subsequence be found in O(n log n)?
A
Sort the array
B
Keep tails[k] = smallest tail of an increasing subsequence of length k+1, and binary search where each element goes
C
Check all subsequences
D
Use a hash map of counts