1
# Runtime: 111 ms (Top 25.49%) | Memory: 14.1 MB (Top 45.43%)
2
class Solution:
3
    def slowestKey(self, releaseTimes: List[int], keysPressed: str) -> str:
4
        max_dur = releaseTimes[0]
5
        max_key = keysPressed[0]
6

7
        for i in range(1, len(releaseTimes)):
8
            if releaseTimes[i] - releaseTimes[i - 1] > max_dur:
9
                max_dur = releaseTimes[i] - releaseTimes[i - 1]
10
                max_key = keysPressed[i]
11
            elif (
12
                releaseTimes[i] - releaseTimes[i - 1] == max_dur
13
                and max_key < keysPressed[i]
14
            ):
15
                max_key = keysPressed[i]
16

17
        return max_key