Python simple recursion and iterative
If k = 1, remove largest digit in a sequence starting at beginning. \nEx:\na) 23432 -> remove 4,\nb) 12345 -> remove 5, \nc) 4321 ->remove 4\n\nDo this k times\
If k = 1, remove largest digit in a sequence starting at beginning. \nEx:\na) 23432 -> remove 4,\nb) 12345 -> remove 5, \nc) 4321 ->remove 4\n\nDo this k times\n\n```\nclass Solution(object):\n    def remove_leading_zero(self, num):\n        i = 0\n        while i < len(num) and num[i] == \'0\':\n            i += 1\n        \n        if i == len(num):\n            return \'0\'\n        return num[i:]\n    \n\t# ITERATIVE SOLUTION\n\tdef removeKdigits(self, num, k):\n        if k == len(num):\n            return \'0\'\n        \n        for i in range(k):\n            to_remove_index = 0\n            while to_remove_index < len(num)-1 and num[to_remove_index] <= num[to_remove_index + 1]:\n                to_remove_index += 1\n            num = num[:to_remove_index] + num[to_remove_index+1:]\n            \n        return self.remove_leading_zero(num)\n    \n\t# RECURSIVE SOLUTION\n    def removeKdigitsRecursive(self, num, k):\n        if k == len(num):\n            return \'0\'\n        \n        if k == 0:\n            return self.remove_leading_zero(num)\n    \n        to_remove_index = 0\n        while to_remove_index < len(num)-1 and num[to_remove_index] <= num[to_remove_index + 1]:\n            to_remove_index += 1\n\n        return self.removeKdigitsRecursive(num[:to_remove_index] + num[to_remove_index+1:], k-1)\n\t
['Recursion', 'Iterator', 'Python']