# Solving Leetcode Interviews in Seconds with AI: Find the Maximum Achievable Number


	# Introduction
	In this blog post, we will explore how to solve the LeetCode problem "2769" using AI. LeetCode is a popular platform for preparing for coding interviews, and with the help of AI tools like [Chatmagic](https://www.chatmagic.app), we can generate solutions quickly and efficiently - helping you pass the interviews and get the job offer without having to study for months.

	# Problem Statement
	> 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.  Return the maximum possible value of x.   Example 1:  Input: num = 4, t = 1 Output: 6 Explanation: Apply the following operation once to make the maximum achievable number equal to num:  Decrease the maximum achievable number by 1, and increase num by 1.   Example 2:  Input: num = 3, t = 2 Output: 7 Explanation: Apply the following operation twice to make the maximum achievable number equal to num:  Decrease the maximum achievable number by 1, and increase num by 1.     Constraints:  1 <= num, t <= 50  

	# Explanation
	Here's the solution:

*   **Understanding the Operation:** Each operation effectively changes the difference between `x` and `num` by 2. The problem asks us to maximize x.
*   **Maximizing x:** To maximize `x`, we want to perform 't' operations in a way such that we add to the initial value of `x`. For each operation, consider decreasing x by 1 and increasing num by 1. Then the difference between num and x becomes larger, meaning after t operations, num is larger than x. So x will need to start with larger value and decrease by 1 while num increases by 1. The opposite will happen if x starts with small value and increases by 1 while num decreases by 1.
*   **Final Calculation:** Since the difference changes by 2 with each operation, the maximum achievable value of `x` will be `num + 2 * t`.

*   **Runtime Complexity:** O(1) & **Storage Complexity:** O(1)

	
	# Code
	```python
	def get_max_achievable_number(num: int, t: int) -> int:
    """
    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.
    Return the maximum possible value of x.

    Example 1:
    Input: num = 4, t = 1
    Output: 6
    Explanation: Apply the following operation once to make the maximum achievable number equal to num:
    Decrease the maximum achievable number by 1, and increase num by 1.

    Example 2:
    Input: num = 3, t = 2
    Output: 7
    Explanation: Apply the following operation twice to make the maximum achievable number equal to num:
    Decrease the maximum achievable number by 1, and increase num by 1.

    Constraints:
    1 <= num, t <= 50
    """
    return num + 2 * t
	```