Good morning! Here's your coding interview problem for today.
This problem was asked by Facebook.
Describe an algorithm to compute the longest increasing subsequence of an array of numbers in O(n log n) time.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
Good morning! Here's your coding interview problem for today.
This problem was asked by Facebook.
Describe an algorithm to compute the longest increasing subsequence of an array of numbers in O(n log n) time.