Home

Longest Increasing Subsequence

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 [0, 3, 1, 6, 2, 2, 7].

The longest increasing subsequence is bolded in the sample tests below, but you only need to return its length.

LIS([10, 9, 2, 5, 3, 7, 101, 18]) → 4
LIS([0, 1, 0, 3, 2, 3]) → 4
LIS([7, 7, 7, 7, 7, 7, 7]) → 1

😳 TIME LEFT: seconds 😳

function LIS(nums) {

}

⏰ TOTAL TIME: seconds ⏰