Compute longest increasing subsequence length

## Coding Question You are given an integer array `nums`. Return the **length** of the **longest strictly increasing subsequence** (not necessarily contiguous). A subsequence is obtained by deleting zero or more elements without changing the order of the remaining elements. ### Examples - Input: `nums = [10,9,2,5,3,7,101,18]` → Output: `4` (one LIS is `[2,3,7,101]`) - Input: `nums = [0,1,0,3,2,3]` → Output: `4` - Input: `nums = [7,7,7,7]` → Output: `1` ### Constraints - `1 <= nums.length <= 2 * 10^5` - `-10^9 <= nums[i] <= 10^9` ### Notes A straightforward dynamic programming solution is `O(n^2)`. Can you derive an optimized approach (commonly described as greedy with binary search) that runs in about `O(n log n)`?