2337. Remove Digit From Number to Maximize Result
My accepted Python solution to LeetCode problem 2337, Remove Digit From Number to Maximize Result, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.4MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
Python
Accepted on LeetCode — runtime 0ms, memory 17.4MB, accepted 2025-12-29.
class Solution:
def removeDigit(self, number: str, digit: str) -> str:
max_result = ""
for i in range(len(number)):
if number[i] == digit:
result = number[:i] + number[i+1:]
if result > max_result:
max_result = result
return max_result