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.