Interview question of the issue #361 of rendezvous with cassidoo.
Given an integer array nums
, return the length of the longest increasing subsequence.
Example:
> increasingSubsequence([10, 9, 2, 3, 7, 101, 18])
> 4
> increasingSubsequence([4, 4, 4, 4, 3])
> 1
Just pnpm i
to install all dependencies and then pnpm t
to run the tests!