Category: Dynamic Programming
Difficulty: intermediate
Description: Find LIS in array
Time Complexity: O(n log n)
Space Complexity: O(n)