Expert35 min

Longest Increasing Subsequence

Return the length of the longest strictly increasing subsequence. The chosen values do not have to be adjacent.

Your function

Implement solve(value, extra) in JavaScript. Return the answer; printing alone does not count as a result.

Examples

Input: [[10,9,2,5,3,7,101,18]]
Output: 4
Input: [[3,3,3]]
Output: 1

Constraints

Input contains at most 1,000 values or characters. Numbers are finite integers. Inputs follow the structure shown in the examples.

13px
main.jsYour ideas, in code.
Loading your editor…
Run your code to see the output here.
Ready to buildUTF-84 lines

Test freely without an account. Signed-in submissions are checked independently by the isolated execution service before progress is awarded.