LC-2259 Easy LeetCode

2259. Remove Digit From Number to Maximize Result

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 47% Topics: String, Greedy, Enumeration

Reading material

Strings 12 min Greedy 11 min Backtracking 14 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(1)

# greedy
class Solution(object):
    def removeDigit(self, number, digit):
        """
        :type number: str
        :type digit: str
        :rtype: str
        """
        i = next((i for i in xrange(len(number)-1) if digit == number[i] < number[i+1]), len(number)-1)
        if i+1 == len(number):
            i = next((i for i in reversed(xrange(len(number))) if digit == number[i]))
        return number[:i]+number[i+1:]

Solution from kamyu104/LeetCode-Solutions · MIT