Longest Increasing Subsequence
Amazon● MediumFULLTIMEONSITE INTERVIEWProblem statement
Given an integer array nums, return the length of its longest strictly increasing subsequence.
The problem statement continues
ProExamples
Example 1
nums = [10,9,2,5,3,7,101,18]return = 4One longest strictly increasing subsequence is [2, 3, 7, 101], which has length 4.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 2 more worked examples, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week