Nov 18

Author: siddydutta

2024-11-November-LeetCoding-Challenge/Defuse the Bomb.py

@@ -0,0 +1,34 @@
+from typing import List
+
+
+class Solution:
+    def decrypt(self, code: List[int], k: int) -> List[int]:
+        n = len(code)
+        result = [0] * n
+        if k == 0:
+            return result
+
+        for i in range(n):
+            if k > 0:
+                result[i] = sum(code[(i+j) % n] for j in range(1, k+1))
+            elif k < 0:
+                result[i] = sum(code[(i+j) % n] for j in range(-1, k-1, -1))
+        return result
+
+
+def main():
+    code = [5, 7, 1, 4]
+    k = 3
+    assert Solution().decrypt(code, k) == [12, 10, 16, 13]
+
+    code = [1, 2, 3, 4]
+    k = 0
+    assert Solution().decrypt(code, k) == [0, 0, 0, 0]
+
+    code = [2, 4, 9, 3]
+    k = -2
+    assert Solution().decrypt(code, k) == [12, 5, 6, 13]
+
+
+if __name__ == '__main__':
+    main()

2024-11-November-LeetCoding-Challenge/README.md

@@ -20,7 +20,7 @@
 | November 15 | [1574. Shortest Subarray to be Removed to Make Array Sorted](https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted/) | Medium | Unsolved |
 | November 16 | [3254. Find the Power of K-Size Subarrays I](https://leetcode.com/problems/find-the-power-of-k-size-subarrays-i/) | Medium | Solved |
 | November 17 | [862. Shortest Subarray with Sum at Least K](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/) | Hard | Solved |
-| November 18 | []() |  |  |
+| November 18 | [1652. Defuse the Bomb](https://leetcode.com/problems/defuse-the-bomb/) | Easy | Solved |
 | November 19 | []() |  |  |
 | November 20 | []() |  |  |
 | November 21 | []() |  |  |
@@ -37,6 +37,6 @@
 ## Summary
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
-| Easy   | 3 | 3 | 0 |
+| Easy   | 4 | 4 | 0 |
 | Medium | 13 | 6 | 7 |
 | Hard   | 1 | 1 | 0 |