Medium
Return the length of the longest strictly increasing subsequence.
Find the length of the longest subsequence of the array such that elements are strictly increasing and not necessarily contiguous.
Examples
Input: nums = [10,9,2,5,3,7,101,18]
Output: 4
Constraints
- 1 <= nums.length