# Solving Leetcode Interviews in Seconds with AI: Teemo Attacking


	# Introduction
	In this blog post, we will explore how to solve the LeetCode problem "495" 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
	> Our hero Teemo is attacking an enemy Ashe with poison attacks! When Teemo attacks Ashe, Ashe gets poisoned for a exactly duration seconds. More formally, an attack at second t will mean Ashe is poisoned during the inclusive time interval [t, t + duration - 1]. If Teemo attacks again before the poison effect ends, the timer for it is reset, and the poison effect will end duration seconds after the new attack. You are given a non-decreasing integer array timeSeries, where timeSeries[i] denotes that Teemo attacks Ashe at second timeSeries[i], and an integer duration. Return the total number of seconds that Ashe is poisoned.   Example 1:  Input: timeSeries = [1,4], duration = 2 Output: 4 Explanation: Teemo's attacks on Ashe go as follows: - At second 1, Teemo attacks, and Ashe is poisoned for seconds 1 and 2. - At second 4, Teemo attacks, and Ashe is poisoned for seconds 4 and 5. Ashe is poisoned for seconds 1, 2, 4, and 5, which is 4 seconds in total.  Example 2:  Input: timeSeries = [1,2], duration = 2 Output: 3 Explanation: Teemo's attacks on Ashe go as follows: - At second 1, Teemo attacks, and Ashe is poisoned for seconds 1 and 2. - At second 2 however, Teemo attacks again and resets the poison timer. Ashe is poisoned for seconds 2 and 3. Ashe is poisoned for seconds 1, 2, and 3, which is 3 seconds in total.   Constraints:  1 <= timeSeries.length <= 104 0 <= timeSeries[i], duration <= 107 timeSeries is sorted in non-decreasing order.  

	# Explanation
	Here's the solution to the problem:

*   Iterate through the `timeSeries` array.
*   For each attack, calculate the poison duration considering potential overlaps with the previous attack's poison duration.
*   Accumulate the total poisoned time.

*   Runtime Complexity: O(n), Storage Complexity: O(1)

	
	# Code
	```python
	def findPoisonedDuration(timeSeries, duration):    """
    Calculates the total poisoned duration of Ashe based on Teemo's attacks.

    Args:
        timeSeries (list of int): A non-decreasing array of attack times.
        duration (int): The duration of the poison effect.

    Returns:
        int: The total number of seconds Ashe is poisoned.
    """

    total_poisoned_time = 0
    if not timeSeries:
        return 0

    for i in range(len(timeSeries) - 1):
        total_poisoned_time += min(duration, timeSeries[i+1] - timeSeries[i])

    total_poisoned_time += duration  # Add the duration for the last attack

    return total_poisoned_time
	```