Longest Increasing Subsequence
Problem
Given an integer array nums, return the length of the longest strictly increasing subsequence. (link)
Example 1:
Input: nums = [10,9,2,5,3,7,101,18]
Output: 4
Explanation: The longest increasing subsequence is [2,3,7,101], therefore the lengt...
