Find the Maximum Achievable Number — LeetCode 2769 Python Solution

The problem

Given two integers, num and t. A number x is achievable if it can become equal to num after applying the following operation at most t times: Increase or decrease x by 1, and simultaneously increase or decrease num by 1.

Python solution

class Solution:
    def theMaximumAchievableX(self, num: int, t: int) -> int:
        return num + t * 2

Complexity

Pattern: Math and Number Theory

Find the closed form, the invariant, or the modular identity — and skip the loop entirely. LeetCode 2769. Find the Maximum Achievable Number is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Math.

The math and number theory guide has the Python template for the pattern and the 485 LeetCode problems that use it.

Related problems