Remove Digit From Number to Maximize Result — LeetCode 2259 Python Solution

The problem

You are given a string number representing a positive integer and a character digit. Return the resulting string after removing exactly one occurrence of digit from number such that the value of the resulting string in decimal form is maximized.

Example

Input

number = "123", digit = "3"

Output

"12"

Explanation

There is only one '3' in "123". After removing '3', the result is "12".

Python solution

class Solution:
    def removeDigit(self, number: str, digit: str) -> str:
        return max(
            number[:i] + number[i + 1 :] for i, d in enumerate(number) if d == digit
        )

Complexity

Pattern: Greedy

Take the locally best option every time — when you can prove that never costs you later. LeetCode 2259. Remove Digit From Number to Maximize Result is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Greedy.

The greedy guide has the Python template for the pattern and the 346 LeetCode problems that use it.

Related problems