Remove K Digits | Remove K Digits LeetCode Solution Java | LeetCode 402

Remove K digits to make smallest number LeetCode Solution using Java Code. In this problem we have to Find the smallest number after removing k digits from the input number.

Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.

LeetCode May Challenge PlayList - https://www.youtube.com/watch?v=Usm-QCwTQcg&list=PLUg9hRlm7gxSX8aXepxe54oslSpMvmyh4

LeetCode April Challenge PlayList - https://www.youtube.com/watch?v=-I1pUv57WG8&list=PLUg9hRlm7gxT8mrwa_648iC8Ah42E0W1o

Note:
The length of num is less than 10002 and will be ≥ k.
The given num does not contain any leading zero.

For example -

Example 1:

Input: num = "12345", k = 1
Output: "1234"

Explanation: Remove the digit 5 to form
the new number 1234 which is the smallest.

Example 2:

Input: num = "1432219", k = 3
Output: "1219"

Explanation: Remove the three digits 4, 3, and 2 to form
the new number 1219 which is the smallest.


Example 3:

Input: num = "10200", k = 1
Output: "200"
Explanation: Remove the leading 1 and the number is 200.
Note that the output must not contain leading zeroes.


Example 3:

Input: num = "10", k = 2
Output: "0"
Explanation: Remove all the digits from the number and it is left with nothing which is 0.

Website - https://webrewrite.com/
Paypal - https://www.paypal.me/programmingtutorials