All challenges
Algorithm challenge · DSA
Longest Increasing Subsequence
Difficulty
hard
Time
~35m
Format
Single
Grading
Auto-graded
#python#javascript#typescript#go#java#cpp#rust#dsa#dynamic-programming#binary-search
Mission file // read carefullyhard
Given an integer array nums, return the length of the longest strictly increasing subsequence.
Example
nums = [10,9,2,5,3,7,101,18] => 4 ([2,3,7,101])
Build with
lengthOfLIS(nums: int[]) → intPythonJavaScriptTypeScriptGoJavaC++Rust
5 tests · 2 hidden
Auto-graded on submit
Start challenge
Sign in to save your progress.