hardJS ES5#115

LIS (longest increasing subsequence)

Prompt

Find the length of the longest strictly increasing subsequence in an array of integers. A subsequence keeps relative order but need not be contiguous. Empty array returns 0.

Hints

Solution

Your Code

15 min

Tests

Click Run to test your code