Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1964. Find the Longest Valid Obstacle Course at Each Position
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source