Decreasing Prices
Programming Interview
Questions
Decreasing Prices
Given an integer array prices, return the length of the longest strictly decreasing subsequence.
Example 1:
- prices: [100, 80, 70, 120, 90, 110, 60]
Output: 3, since the longest decreasing subsequence is [100, 80, 70, 60].
Your code must run in SuperLinear time O(nlogn).
Tests - Login / Sign up to submit your code!
Efficiency
Test Case 1
Test Case 2
Test Case 3
Test Case 4
Test Case 5
Test Case 6
Test Case 7
Test Case 8
Test Case 9
Test Case 10
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results
Submit to See Results