You are given a circular array code of length n and an integer key k.

To decrypt the code, replace every element according to the value of k:

• If k > $0$, replace the $i^{ ext{th}}$ number with the sum of the next k numbers.

• If k < $0$, replace the $i^{ ext{th}}$ number with the sum of the previous $|k|$ numbers.

• If k == $0$, replace the $i^{ ext{th}}$ number with $0$.

As code is circular, the next element after code[n - 1] is code[0], and the element before code[0] is code[n - 1].

Return an array representing the decrypted code.

Constraints:

• n $==$ code.length

• $1 \leq n \leq 100$

• $1 \leq$ code[i] $\leq 100$

• $-(n - 1) \leq$ k $\leq n - 1$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.