Longest Increasing Subsequence

Given array nums, return the length of the longest strictly increasing subsequence.

Example: nums=[10,9,2,5,3,7,101,18] → 4 (subsequence: [2,3,7,101])

Follow up: O(n log n) solution?