Cisco Coding Round | Rejected

The interviewer gave the question on a coder pad link, asked to share screen. Post that there was very limited interaction, only to discuss the test cases. Got 0 hints...

The interviewer gave the question on a coder pad link, asked to share screen. Post that there was very limited interaction, only to discuss the test cases. Got 0 hints or suggestions on the implementation.

Q: https://leetcode.com/problems/remove-k-digits/

Statement:

# Given a number, remove n characters to find the minimum number.

# Ex 1: 19345 , n = 3

# Outout = 13

**Explanation**: Removing 9,4,5 characters results in minimum number

# Ex 2: 100200, n = 1

**output** = 200

**Explanation**: Removing 1 results in minimum number