Add solution #1652

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,449 LeetCode solutions in JavaScript
+# 1,450 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1272,6 +1272,7 @@
 1647|[Minimum Deletions to Make Character Frequencies Unique](./solutions/1647-minimum-deletions-to-make-character-frequencies-unique.js)|Medium|
 1648|[Sell Diminishing-Valued Colored Balls](./solutions/1648-sell-diminishing-valued-colored-balls.js)|Medium|
 1649|[Create Sorted Array through Instructions](./solutions/1649-create-sorted-array-through-instructions.js)|Hard|
+1652|[Defuse the Bomb](./solutions/1652-defuse-the-bomb.js)|Easy|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|
 1668|[Maximum Repeating Substring](./solutions/1668-maximum-repeating-substring.js)|Easy|
 1669|[Merge In Between Linked Lists](./solutions/1669-merge-in-between-linked-lists.js)|Medium|

solutions/1652-defuse-the-bomb.js

@@ -0,0 +1,44 @@
+/**
+ * 1652. Defuse the Bomb
+ * https://leetcode.com/problems/defuse-the-bomb/
+ * Difficulty: Easy
+ *
+ * You have a bomb to defuse, and your time is running out! Your informer will provide you with
+ * a circular array code of length of n and a key k.
+ *
+ * To decrypt the code, you must replace every number. All the numbers are replaced simultaneously.
+ * - If k > 0, replace the ith number with the sum of the next k numbers.
+ * - If k < 0, replace the ith number with the sum of the previous k numbers.
+ * - If k == 0, replace the ith number with 0.
+ *
+ * As code is circular, the next element of code[n-1] is code[0], and the previous element of
+ * code[0] is code[n-1].
+ *
+ * Given the circular array code and an integer key k, return the decrypted code to defuse the bomb!
+ */
+
+/**
+ * @param {number[]} code
+ * @param {number} k
+ * @return {number[]}
+ */
+var decrypt = function(code, k) {
+  const n = code.length;
+  const result = new Array(n).fill(0);
+
+  if (k === 0) return result;
+
+  const isPositive = k > 0;
+  const steps = Math.abs(k);
+
+  for (let i = 0; i < n; i++) {
+    let sum = 0;
+    for (let j = 1; j <= steps; j++) {
+      const index = isPositive ? (i + j) % n : (i - j + n) % n;
+      sum += code[index];
+    }
+    result[i] = sum;
+  }
+
+  return result;
+};