Leetcode 1673. Find the Most Competitive Subsequence

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1673. Find the Most Competitive Subsequence

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact