Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1964. Find the Longest Valid Obstacle Course at Each Position
For each index i, compute the length of the longest non-decreasing subsequence (in original order and including i) that ends at i. With n up to 1e5, this is typically solved in O(n log n) using the LIS/patience-sorting pattern by maintaining tails and binary-searching for insert positions (allowing equal values).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.