← Questions
Longest increasing subsequence
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Given a series of prices (or monthly profits, which may be zero or negative) in time order, return the length of the longest subsequence whose values strictly increase. Start with the quadratic dynamic program, then bring it down to O(n log n) with the patience-sorting array of smallest tails and binary search.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding