Longest Increasing Subsequence

Return the length of the longest strictly increasing subsequence of nums. A subsequence keeps the order but may skip elements.

Examples

Example 1

Input:  nums = [10, 9, 2, 5, 3, 7, 101, 18]
Output: 4

For example [2, 3, 7, 101].