Problem

Submissions

Solution

New

Discuss

2

Difficulty: MEDIUM

Avg. time to solve

25 min

Success Rate

75%

Problem Statement

Suggest Edit

```
‘NUM’ does not have leading zeros except when ‘NUM’ is equal to zero.
```

```
The first line contains an integer, ‘T’, which denotes the number of test cases to be run. Then, the T test cases follow.
The first line of each test case contains a string ‘NUM’ and integer ‘K.’
```

```
For each test case, print a single string, the minimum integer that can be possibly made by removing ‘K’ digits from ‘NUM’.
Output for each test case will be printed in a separate line.
```

```
You don’t have to print anything. It has already been taken care of. Just implement the given function.
```

```
1 <= T <=10
2 <= |NUM| <= 10^5
0 <= K <= |NUM|
Where ‘T’ denotes the number of test cases and |’NUM’| denotes the length of the initial string ‘NUM’ and ‘K’ denotes the number of digits to be removed.
Time limit: 1 second
```

```
1
3214
2
```

```
14
```

```
You are allowed to remove exactly 2 digits from the initial number. We get “21” on removing the first digit: ‘3’ and the last digit: ‘4’. All other possible answers are greater than “21”.
```

```
2
541
3
123
1
```

```
0
12
```

```
For the first test case, on removing 3 digits the initial number becomes empty i.e “0”.
For the second test case, we can remove the last digit “3” to get the smallest possible answer “12”. Other possible answers are “23”, “13” and all of them are greater than “12”.
```

Console