โ† All coding problems

Longest increasing subsequence

HardDynamic programming

Return the length of the longest strictly increasing subsequence of nums (the numbers need not be next to each other).

Function
function solve(nums)
Example 1
nums = [10,9,2,5,3,7,101,18]
โ†’ 4

Submit also runs 4 hidden tests, including edge cases.

console.log output is shown below