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