Longest Increasing Subsequence

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.

lengthOfLIS([10, 9, 2, 5, 3, 7, 101, 18]); // 4
// The longest increasing subsequence is [2, 3, 7, 101], therefore the length is 4.