Longest Increasing Subsequence
MediumDynamic ProgrammingDynamic Programming
Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.
Practice this as a mock interviewFree to start, no account neededProblem
Given an integer array nums, return the length of the longest strictly increasing subsequence.
Examples
Input: nums = [10,9,2,5,3,7,101,18]
Output: 4
The longest increasing subsequence is [2,3,7,101], therefore the length is 4.
Input: nums = [0,1,0,3,2,3]
Output: 4
Input: nums = [7,7,7,7,7,7,7]
Output: 1
Constraints
- 1 <= nums.length <= 2500
- -10^4 <= nums[i] <= 10^4
What the interviewer grades
A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.