DSA Level 2 Data Structures Stacks Lexicographically Smallest Subsequence

Lexicographically Smallest Subsequence

medium

1. Given an integer array nums and a positive integer k;
2. return the lexicographically smallest subsequence of size k;

Input Format

Input is managed for you

Output Format

Output is managed for you

Constraints

1. 1 &lt;= nums.length &lt;= 10^5
2. 1 &lt;= nums[i] &lt;= 10^9
3. 1 &lt;= k &lt;= nums.length

Notice

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

Example

Input

Output

Basic Calculator Iii

Max-stack

Related Questions

medium Next Greater Element To The Right easy Next Greater Element I easy Next Greater Element Ii medium Validate Stack Sequences medium Design A Stack With Increment Operation medium Minimum Add To Make Parentheses Valid medium Score Of Parentheses medium Reverse Substrings Between Each Pair Of Parentheses medium Minimum Remove To Make Valid Parentheses medium Online Stock Span medium Exclusive Time Of Functions medium 132 Pattern medium Remove K Digits medium Asteroid Collision medium Remove Duplicate Letters hard Largest Area Histogram 2