Deviopath › Go

Longest Increasing Subsequence Length

Hard · Algorithms

Return the length of the longest strictly increasing subsequence of nums. Patience sorting (O(n log n)) or DP (O(n²)) both work.

Write LIS(nums).

Next: Median of Two Sorted Arrays