Given an integer array
nums, return the length of the longest strictly increasing subsequence.
A subsequence is a sequence that can be derived from an array by deleting some or no elements without changing the order of the remaining elements. For example,
[3,6,2,7] is a subsequence of the array
Input: nums = [2, 1, 0, 3, 2, 3]
Explanation: The longest increasing subsequence is [1, 2, 3], therefore the length is 3Note that there can be…