Longest Increasing Price Subsequence
OpenAI● MediumNEW GRADOAProblem statement
You are given an integer array prices containing financial values in chronological order. The values can represent recorded prices or consecutive monthly net profits; net profits may be negative or zero. Return the maximum number of values you can select so that the selected values are strictly increasing.
The problem statement continues
ProExamples
Example 1
prices = [10,9,2,5,3,7,101,18]return = 4One longest strictly increasing subsequence is [2, 3, 7, 18]. Its elements occur in their original order, and its length is 4.
Original screenshot from the interview report
ProFastPrep Pro
Reported in 2 OpenAI interviews 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
- 3 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