2812. Find the Maximum Achievable Number
My accepted Python solution to LeetCode problem 2812, Find the Maximum Achievable Number, running in 0ms.
- Difficulty: Easy
- Python
- Runtime 0ms
- Memory 17.3MB
- 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.3MB, accepted 2026-01-01.
class Solution:
def theMaximumAchievableX(self, num: int, t: int) -> int:
# Each operation decreases distance by 2 (x decreases by 1, num increases by 1)
# So maximum x = num + 2*t
return num + 2 * t