Defuse the Bomb Python Solution with Tests

lcpy gen -n 1652   # by problem number
lcpy gen -s defuse_the_bomb   # by problem name

Input: code = [5,7,1,4], k = 3
Output: [12,10,16,13]
Explanation: Each number is replaced by the sum of the next 3 numbers. The decrypted code is [7+1+4, 1+4+5, 4+5+7, 5+7+1]. Notice that the numbers wrap around.

Input: code = [1,2,3,4], k = 0
Output: [0,0,0,0]
Explanation: When k is zero, the numbers are replaced by 0.

Input: code = [2,4,9,3], k = -2
Output: [12,5,6,13]
Explanation: The decrypted code is [3+9, 2+3, 4+2, 9+4]. Notice that the numbers wrap around again. If k is negative, the sum is of the previous numbers.

class Solution:
    # Time: O(n)
    # Space: O(1) extra (output excluded)
    def decrypt(self, code: list[int], k: int) -> list[int]:
        n = len(code)
        if k == 0:
            return [0] * n
        window = abs(k)
        offset = 1 if k > 0 else -window
        total = sum(code[(offset + j) % n] for j in range(window))
        result = [0] * n
        for i in range(n):
            result[i] = total
            total += code[(i + offset + window) % n] - code[(i + offset) % n]
        return result