Longest Increasing Subsequence · Coding Interview Practice

Longest Increasing SubsequenceGiven an integer array, return the length of the longest strictly increasing subsequence.Constraints

1 <= nums.length <= 2500

-10^4 <= nums[i] <= 10^4

Examples

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

Input: nums = [0,1,0,3,2,3] Output: 4

LetsDiscuss

Loading your session…