## May 13, 2020

### #LeetCode: Remove K Digits

Given a non-negative integer number represented as a string, remove k digits from the number so that the new number is the smallest possible.
Note:
The length of num is less than 10002 and will be ≥ k.
The given num does not contain any leading zero

Example 1: 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 2: 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.

Algorithm:
1. We will iterate for k times.
2. In each iteration we will check remove the current digit if it's equal or smaller then next number.
3. After iteration, we need to remove all the leading zeros.
GIT URL: Java Solution Of Leet Code's Remove K Digits problem

Java Solution
ALSO CHECKOther LeetCode Solutions in Java

-K Himaanshu Shuklaa.