Solution: Remove K Digits
Let’s solve the Remove K Digits problem using the Greedy Techniques pattern.
We'll cover the following...
Statement
Given a string, num, that represents a non-negative integer and an integer k, remove exactly k digits from num so that the remaining digits form the smallest possible number.
Constraints:
...
Ask