Available question text
Return the length-k subsequence of nums (keeping original order) that is lexicographically smallest according to the "most competitive" definition. This is typically solved with a greedy monotonic-stack pattern: choose elements while discarding larger previous ones when enough elements remain to still reach k.
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 1673. Find the Most Competitive Subsequence
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source