Do daily

Author: Zanger67

my-submissions/e3392 oneliner.py

@@ -0,0 +1,3 @@
+class Solution:
+    def countSubarrays(self, nums: List[int]) -> int:
+        return sum([1 if nums[i] + nums[i + 2] == nums[i + 1] / 2 else 0 for i in range(len(nums) - 2)])

my-submissions/e3392.py

@@ -0,0 +1,7 @@
+class Solution:
+    def countSubarrays(self, nums: List[int]) -> int:
+        output = 0
+        for i in range(len(nums) - 2) :
+            if nums[i] + nums[i + 2] == nums[i + 1] / 2 :
+                output += 1
+        return output