Faster than 100% of Python3 Solutions [ScreenShot Attached 😊]
Note : Iterate over the series while keeping track of max time of poison reached till now.\nPython\nclass Solution:\n    def findPoisonedDuration(self, timeSeri
Note : Iterate over the series while keeping track of max time of poison reached till now.\n```Python\nclass Solution:\n    def findPoisonedDuration(self, timeSeries: List[int], duration: int) -> int:\n        if len(timeSeries) == 0:\n            return 0\n        \n        total_duration = duration\n        max_duration = timeSeries[0] + duration - 1\n        \n        for time in timeSeries[1:]:\n            curr_duration = time + duration - 1\n            \n            if time <= max_duration:\n                diff = curr_duration - max_duration\n            else:\n                diff = duration\n                \n            total_duration += diff\n            max_duration = curr_duration\n        \n        return total_duration\n```\nAttaching a screenshot for Proof \n![image](https://assets.leetcode.com/users/images/ae4f4ed1-9c1c-402c-8cdf-2bb505a221ef_1601156458.0300622.png)\n
[]