Leetcode 402. Remove K Digits

Given string num representing a non-negative integer num, and an integer k, return the smallest possible integer after removing k digits from num. URL: https://leetcode.com/problems/remove-k-digits/ My solution: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 class Solution { public String removeKdigits(String num, int k) { if (num.isEmpty()) { return "0"; } Deque<Character> deque = n...

Submit