Solution: Longest Increasing Subsequence

Statement

The Longest Increasing Subsequence (LIS) is the longest subsequence from a given array in which the subsequence elements are sorted in a strictly increasing order. Given an integer array, nums, find the length of the LIS in this array.

Constraints:

• $1 \leq$ nums.length $\leq 985$
• $-10^4 \leq$ nums[i] $\leq 10^4$

Solution

So far, you’ve probably brainstormed some approaches and have an idea of how to solve ...